Conditional chromatic numbers with forbidden cycles
From MaRDI portal
Recommendations
Cites work
- Arc coverings of graphs
- Graph Theory and Probability
- scientific article; zbMATH DE number 3885934 (Why is no real title available?)
- scientific article; zbMATH DE number 3910413 (Why is no real title available?)
- scientific article; zbMATH DE number 3979083 (Why is no real title available?)
- scientific article; zbMATH DE number 4008419 (Why is no real title available?)
- scientific article; zbMATH DE number 4051672 (Why is no real title available?)
- scientific article; zbMATH DE number 4053680 (Why is no real title available?)
- scientific article; zbMATH DE number 3271353 (Why is no real title available?)
- scientific article; zbMATH DE number 3276423 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- On chromatic number of finite set-systems
- On generalized graph colorings
- On Partitioning Planar Graphs
- ON UNIQUELY -G k-COLOURABLE GRAPHS
- Parallel concepts in graph theory
- The point-arboricity of a graph
- The Point-Arboricity of Planar Graphs
- The subchromatic number of a graph
Cited in
(7)- Conditional colorings of graphs
- Chromatic sums for colorings avoiding monochromatic subgraphs
- Generalized chromatic numbers of graphs with bipartite complements
- Generalized chromatic numbers of graphs with prescribed complements
- scientific article; zbMATH DE number 3979083 (Why is no real title available?)
- scientific article; zbMATH DE number 25546 (Why is no real title available?)
- Extremal G-free induced subgraphs of Kneser graphs
This page was built for publication: Conditional chromatic numbers with forbidden cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805306)