A concise proof for total coloring subcubic graphs
From MaRDI portal
Publication:2444906
DOI10.1016/j.ipl.2013.06.003zbMath1285.05059MaRDI QIDQ2444906
Publication date: 11 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.003
graph algorithms; cubic graphs; total chromatic number; total coloring; subcubic graphs; 3-regular graphs
Related Items
Coloring 3-power of 3-subdivision of subcubic graph, On the total coloring of generalized Petersen graphs, On the equitable total chromatic number of cubic graphs
Cites Work