Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
From MaRDI portal
Publication:1025479
DOI10.1016/j.disc.2008.04.052zbMath1198.05039OpenAlexW2143157065MaRDI QIDQ1025479
Jason I. Brown, Richard Hoshino
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.052
Related Items (3)
Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Nordhaus–Gaddum problem in terms of G-free coloring ⋮ An inertial lower bound for the chromatic number of a graph
Cites Work
- Graph factorization and theorems of the Nordhaus-Gaddum class
- Some parameters of graph and its complement
- On Ramsey theory and graphical parameters
- On fractional Ramsey numbers
- Extremal graphs in some coloring problems
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- Ramsey theory and chromatic numbers
- Star-extremal graphs and the lexicographic product
- On Complementary Graphs
- Star chromatic number
- Star chromatic numbers and products of graphs
- Star Extremal Circulant Graphs
- On the Point-Arboricity of a Graph and its Complement
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
- Circular chromatic number: A survey
- On circulant chromatic number and circulant chromatic function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
