A concise proof for total coloring subcubic graphs

DOI10.1016/J.IPL.2013.06.003MaRDI QIDQ2444906zbMATH OpenOpenAlexFDO

Authors Yun Feng, Wensong Lin

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

zbMATH Keywords

3-regular graphscubic graphsgraph algorithmssubcubic graphstotal chromatic numbertotal coloring

Mathematics Subject Classification ID

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

Recommendations

• Total colouring of new classes of subcubic graphs
• Total chromatic number of some families of graphs with maximum degree 3
• Recent developments in total colouring
• Equitable total-coloring of subcubic graphs
• Concise proofs for adjacent vertex-distinguishing total colorings

Cites work

• Graph theory
• On the total coloring of certain graphs
• On Total Chromatic Number of a Graph
• The Colour Numbers of Complete Graphs
• Total Colourings of Graphs

Cited in

(12)

• The NP-completeness of (1,r)-subcolorability of cubic graphs
• Inclusion total chromatic number
• Linear colorings of subcubic graphs
• On the total coloring of generalized Petersen graphs
• On the equitable total chromatic number of cubic graphs
• Coloring 3-power of 3-subdivision of subcubic graph
• Total chromatic number of some families of graphs with maximum degree 3
• Total colouring of new classes of subcubic graphs
• Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
• Total colorings-a survey
• On efficient total colorings of regular graphs
• Total colorings of k-regular graphs of girths 2k and k

This page was built for publication: A concise proof for total coloring subcubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444906)