The upper domatic number of a graph
From MaRDI portal
Publication:5154570
DOI10.1016/j.akcej.2018.09.003zbMath1473.05224OpenAlexW2900136945WikidataQ128982474 ScholiaQ128982474MaRDI QIDQ5154570
Alice A. McRae, Stephen T. Hedetniemi, Nicholas C. Phillips, Teresa W. Haynes, Jason T. Hedetniemi
Publication date: 5 October 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2018.09.003
Related Items (3)
Upper domatic number of regular graphs ⋮ Transitivity on subclasses of chordal graphs ⋮ Transitivity on subclasses of bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- Linear algorithm for domatic number problem on interval graphs
- The domatic number problem
- On $k$-domatic numbers of graphs
- Towards a theory of domination in graphs
- Finding a Domatic Partition of an Interval Graph in Time $O(n)$
- The Domatic Number Problem in Interval Graphs
This page was built for publication: The upper domatic number of a graph