Note on incidence chromatic number of subquartic graphs

DOI10.1007/s10878-016-0072-2zbMath1397.05064OpenAlexW2514856348MaRDI QIDQ2410036

Borut Lužar, Petr Gregor, Roman Soták

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0072-2

zbMATH Keywords

incidence coloringincidence chromatic numbersubquartic graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On incidence coloring of graph fractional powers ⋮ Strong incidence coloring of outerplanar graphs ⋮ Hypergraph incidence coloring ⋮ On incidence choosability of cubic graphs ⋮ Incidence choosability of graphs

Cites Work

• Unnamed Item
• On incidence coloring conjecture in Cartesian products of graphs
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• The incidence coloring conjecture for graphs of maximum degree 3
• The star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• Incidence coloring of Cartesian product graphs
• On Representatives of Subsets

This page was built for publication: Note on incidence chromatic number of subquartic graphs