Fraternal augmentations of graphs, coloration and minors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Fraternal augmentations of graphs, coloration and minors

Résumé

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). We generalize to these classes some results proved for proper minor closed classes and bounded degree graphs, such as the existence of low tree-width colorings, a linear time algorithm to check subgraph isomorphism for a fixed pattern and restricted homomorphism dualities.

Dates et versions

hal-00135861 , version 1 (09-03-2007)

Identifiants

Citer

Jaroslav Nesetril, Patrice Ossona de Mendez. Fraternal augmentations of graphs, coloration and minors. Proceedings of the Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Mar 2007, Prague, Czech Republic. pp.223-230, ⟨10.1016/j.endm.2007.01.030⟩. ⟨hal-00135861⟩

Collections

CNRS EHESS
125 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More