Fraternal Augmentations of graphs, Coloration and Minors
From MaRDI portal
Publication:3439588
DOI10.1016/j.endm.2007.01.030zbMath1213.05095MaRDI QIDQ3439588
Patrice Ossona de Mendez, Jaroslav Nešetřil
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.030
graph algorithm; Ramsey number; homomorphism; coloring; subgraph isomorphism; tree-depth; bounded expansion; transitive fraternal augmentation; restricted duality
Related Items
Cites Work
- Universality of \(A\)-mote graphs
- Graph minors. XVI: Excluding a non-planar graph
- Universal \(H\)-colorable graphs without a given configuration
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Tree-depth, subgraph coloring and homomorphism bounds
- Linear time low tree-width partitions and algorithmic consequences