Total coloring of rooted path graphs

DOI10.1016/j.ipl.2018.03.002zbMath1477.05075OpenAlexW2789251892WikidataQ130141146 ScholiaQ130141146MaRDI QIDQ1708273

Martin Charles Golumbic

Publication date: 5 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.03.002

zbMATH Keywords

chordal graphstotal coloringtotal coloring conjecturegreedy neighborhood coloringrooted path graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Even-power of cycles with many vertices are type 1 total colorable ⋮ Total colorings-a survey ⋮ ON GRAPH FOLDING AND MOBILE RADIO FREQUENCY ASSIGNMENT ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs

Cites Work

• Unnamed Item
• Total-chromatic number and chromatic index of dually chordal graphs
• The total chromatic number of split-indifference graphs
• Total chromatic number of unichord-free graphs
• Determining the total colouring number is NP-hard
• Rooted directed path graphs are leaf powers
• Characterizations of strongly chordal graphs
• Intersection graphs of paths in a tree
• A recognition algorithm for the intersection graphs of paths in trees
• Total colouring regular bipartite graphs is NP-hard
• Total colourings of graphs
• Graph Classes: A Survey
• The Colour Numbers of Complete Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Edge and total coloring of interval graphs

This page was built for publication: Total coloring of rooted path graphs