Total coloring of rooted path graphs
type: Item
instance of: scholarly article
title: Total coloring of rooted path graphs
zbMATH Open document ID: 1477.05075
author: Martin Charles Golumbic
published in: Information Processing Letters
publication date: 2018-04-05T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6856073
zbMATH Keywords: total coloring
zbMATH Keywords: rooted path graph
zbMATH Keywords: total coloring conjecture
zbMATH Keywords: greedy neighborhood coloring
zbMATH Keywords: chordal graphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.03.002
OpenAlex ID: W2789251892
cites work: The Colour Numbers of Complete Graphs
cites work: Edge and total coloring of interval graphs
cites work: Rooted directed path graphs are leaf powers
cites work: Graph Classes: A Survey
cites work: The total chromatic number of split-indifference graphs
cites work: Q4697576
cites work: Total-chromatic number and chromatic index of dually chordal graphs
cites work: Characterizations of strongly chordal graphs
cites work: A recognition algorithm for the intersection graphs of paths in trees
cites work: Total chromatic number of unichord-free graphs
cites work: Total colouring regular bipartite graphs is NP-hard
cites work: Intersection graphs of paths in a tree
cites work: Determining the total colouring number is NP-hard
cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY
cites work: Total colourings of graphs
Wikidata QID: Q130141146
DOI: 10.1016/J.IPL.2018.03.002
description: scientific article; zbMATH DE number 6856073