Universal \(H\)-colorable graphs without a given configuration
From MaRDI portal
Publication:1613451
DOI10.1016/S0012-365X(01)00421-6zbMath1001.05060OpenAlexW2148608710MaRDI QIDQ1613451
Christopher Malon, Paul A. jun. Dreyer, Jaroslav Nešetřil
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00421-6
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (10)
Homomorphism bounded classes of graphs ⋮ \(K_{5}\)-free bound for the class of planar graphs ⋮ Homomorphisms and edge-colourings of planar graphs ⋮ Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities ⋮ Unnamed Item ⋮ Tree-depth, subgraph coloring and homomorphism bounds ⋮ Folding ⋮ Cuts and bounds ⋮ The Grad of a Graph and Classes with Bounded Expansion ⋮ Fraternal Augmentations of graphs, Coloration and Minors
This page was built for publication: Universal \(H\)-colorable graphs without a given configuration
