Some results on the incidence coloring number of a graph

DOI10.1016/j.disc.2008.10.027zbMath1250.05051OpenAlexW1985580970MaRDI QIDQ1043553

Jiaojiao Wu

Publication date: 9 December 2009

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

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

zbMATH Keywords

cubic graphsincidence coloringthe square of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Facial incidence colorings of embedded multigraphs ⋮ Oriented incidence colourings of digraphs ⋮ Incidence coloring on hypercubes ⋮ Interval incidence coloring of bipartite graphs ⋮ On incidence coloring of graph fractional powers ⋮ Strong incidence coloring of outerplanar graphs ⋮ On incidence coloring of complete multipartite and semicubic bipartite graphs ⋮ On incidence choosability of cubic graphs ⋮ Incidence choosability of graphs ⋮ Incidence coloring of Cartesian product graphs

Cites Work

• Unnamed Item
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• On incidence coloring for some cubic graphs
• The star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• Labeling Planar Graphs with Conditions on Girth and Distance Two

This page was built for publication: Some results on the incidence coloring number of a graph