Color-critical graphs and hypergraphs with few edges and no short cycles

DOI10.1016/S0012-365X(97)00137-4zbMath0893.05003OpenAlexW2024717990MaRDI QIDQ1379816

J. Ning

Publication date: 25 February 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00137-4

zbMATH Keywords

hypergraphcyclescoloringcolor-critical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the number of edges in hypergraphs critical with respect to strong colourings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse colour-critical hypergraphs
• Distributed density estimation in sensor networks based on variational approximations
• The existence problem for colour critical linear hypergraphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Sparse color‐critical graphs and hypergraphs with no short cycles
• On chromatic number of graphs and set-systems
• On A Combinatorial Problem of Erdös

This page was built for publication: Color-critical graphs and hypergraphs with few edges and no short cycles