Towards the Chen-Raspaud conjecture
From MaRDI portal
Publication:6177406
DOI10.1016/j.disc.2023.113798zbMath1530.05053MaRDI QIDQ6177406
Maria Nazarczuk, Paweł Rzążewski, Katarzyna Łyczek
Publication date: 17 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Homomorphisms from sparse graphs to the Petersen graph
- The strong perfect graph theorem
- Maximum bipartite subgraphs of Kneser graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- \(n\)-tuple coloring of planar graphs with large odd girth
- The footballers of Croam
- The Mathematical Coloring Book
- Link scheduling in polynomial time
- A survey of χ‐boundedness
- An inequality for the chromatic number of a graph
This page was built for publication: Towards the Chen-Raspaud conjecture