Incidence coloring -- cold cases

DOI10.7151/dmgt.2140zbMath1430.05037OpenAlexW2884388760WikidataQ129523693 ScholiaQ129523693MaRDI QIDQ2282487

František Kardoš, Roman Soták, Martina Mockovčiaková, Mária Maceková, Eric Sopena

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2140

zbMATH Keywords

planar graphincidence coloringmaximum average degreeincidence chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Hypergraph incidence coloring ⋮ Incidence coloring of mycielskians with fast algorithm

Cites Work

• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• Planar graphs of maximum degree seven are Class I
• Star arboricity of graphs
• 2-Distance Coloring of Sparse Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Incidence coloring -- cold cases