Some of My Favorite Coloring Problems for Graphs and Digraphs

DOI10.1007/978-3-319-31940-7_7zbMath1352.05069OpenAlexW2534189528MaRDI QIDQ5506778

John G. Gimbel

Publication date: 16 December 2016

Published in: Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_7

zbMATH Keywords

chromatic numbercolor classes

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending the Gyárfás-Sumner conjecture
• Vertex critical r-dichromatic tournaments
• Unsolved problems in geometry
• Some simplified NP-complete graph problems
• Coloring graphs without short non-bounding cycles
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• Colorings and girth of oriented planar graphs
• Color-critical graphs on a fixed surface
• Bounded size components -- partitions and transversals.
• A short list color proof of Grötzsch's theorem
• Partitioning into graphs with only small components
• Subcolorings and the subchromatic number of a graph
• The subchromatic number of a graph
• Bounds on the measurable chromatic number of \({\mathbb{R}}\)
• The dichromatic number of a digraph
• A 15-colouring of 3-space omitting distance one
• A step towards the strong version of Havel's three color conjecture
• Some defective parameters in graphs
• Fixed-parameter algorithms for the cocoloring problem
• Grötzsch's theorem on 3-colorings
• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• Defective coloring revisited
• Three-coloring triangle-free planar graphs in linear time
• The Mathematical Coloring Book
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Some extremal results in cochromatic and dichromatic theory
• Subgraphs with a large cochromatic number
• On subgraphs without large components
• Colouring Planar Graphs With Three Colours and No Large Monochromatic Components

This page was built for publication: Some of My Favorite Coloring Problems for Graphs and Digraphs