On colorings of graphs without short cycles

DOI10.1016/0012-365X(79)90121-3zbMath0407.05037MaRDI QIDQ1257905

Vladimír Müller

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Colourings of Graphs Without Short Cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

In praise of homomorphisms ⋮ When is a random graph projective? ⋮ Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization ⋮ On constructive methods in the theory of colour-critical graphs ⋮ Dualities and dual pairs in Heyting algebras ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Colouring, constraint satisfaction, and complexity ⋮ On sparse graphs with given colorings and homomorphisms. ⋮ Note on robust critical graphs with large odd girth ⋮ On highly ramsey infinite graphs ⋮ Dichotomy for bounded degree \(H\)-colouring ⋮ A combinatorial constraint satisfaction problem dichotomy classification conjecture ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges

Cites Work

• On chromatic number of finite set-systems
• Uniquely colorable graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On colorings of graphs without short cycles