Incidence coloring of pseudo-Halin graphs

DOI10.1016/j.disc.2012.07.024zbMath1252.05068DBLPjournals/dm/MengGS12OpenAlexW2071614356WikidataQ60060538 ScholiaQ60060538MaRDI QIDQ713146

Xianyong Meng, Bentang Su, Jian-hua Guo

Publication date: 26 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.024

zbMATH Keywords

incidenceincidence coloringpseudo-Halin graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On incidence coloring of complete multipartite and semicubic bipartite graphs ⋮ On incidence choosability of cubic graphs ⋮ Incidence coloring of mycielskians with fast algorithm ⋮ Incidence choosability of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Invalid proofs on incidence coloring
• The total chromatic number of pseudo-Halin graphs with lower degree
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• The incidence coloring conjecture for graphs of maximum degree 3
• The star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• NP-completeness of 4-incidence colorability of semi-cubic graphs

This page was built for publication: Incidence coloring of pseudo-Halin graphs