Finding domatic partitions in infinite graphs
From MaRDI portal
Publication:888598
zbMath1323.05102MaRDI QIDQ888598
Matthew Jura, Tyler Markkanen, Oscar Levin
Publication date: 2 November 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/5089
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of computability and recursion theory (03D80) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the domatic number of interval graphs
- The domatic number problem on some perfect graph families
- Domatic partitions of computable graphs
- Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
- Approximating the domatic number
- Effective coloration
- Recursive Colorings of Graphs
This page was built for publication: Finding domatic partitions in infinite graphs
