Total coloring of rooted path graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 749267 (Why is no real title available?)
- A recognition algorithm for the intersection graphs of paths in trees
- Characterizations of strongly chordal graphs
- Determining the total colouring number is NP-hard
- Edge and total coloring of interval graphs
- Graph Classes: A Survey
- Intersection graphs of paths in a tree
- Rooted directed path graphs are leaf powers
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The Colour Numbers of Complete Graphs
- The total chromatic number of split-indifference graphs
- Total chromatic number of unichord-free graphs
- Total colouring regular bipartite graphs is NP-hard
- Total colourings of graphs
- Total-chromatic number and chromatic index of dually chordal graphs
Cited in
(5)
This page was built for publication: Total coloring of rooted path graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708273)