A Combinatorial Classic — Sparse Graphs with High Chromatic Number

DOI10.1007/978-3-642-39286-3_15MaRDI QIDQ5416086zbMATH OpenOpenAlexFDO

Authors J. Nešetřil

Publication date 19 May 2014

Published in Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39286-3_15

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42) Generalized Ramsey theory (05C55)

Recommendations

• Chromaticity of the complements of some sparse graphs
• scientific article; zbMATH DE number 7731183
• scientific article; zbMATH DE number 3895112
• Constructions of sparse uniform hypergraphs with high chromatic number
• On the strong chromatic index of sparse graphs
• scientific article; zbMATH DE number 1998288
• The strong chromatic index of sparse graphs
• A Note on the Sparing Number of Graphs
• Sparse graphs of high gonality
• Strong chromatic index of sparse graphs

Cited in

(13)

• Phase transitions in discrete structures
• Statistics of orderings
• Cycle reversions and dichromatic number in tournaments
• High girth hypergraphs with unavoidable monochromatic or rainbow edges
• On quasi-planar graphs: clique-width and logical description
• Reducing the dichromatic number via cycle reversions in infinite digraphs
• On cylindrical graph construction and its applications
• 1-subdivisions, the fractional chromatic number and the Hall ratio
• Harnessing the Bethe free energy
• Circular coloring of random graphs: statistical physics investigation
• Adding edges to increase the chromatic number of a graph
• Coloring minimal Cayley graphs
• Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth

This page was built for publication: A Combinatorial Classic — Sparse Graphs with High Chromatic Number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5416086)