Incidence choosability of graphs

DOI10.1016/j.dam.2019.04.027zbMath1416.05099arXiv1705.01744OpenAlexW2962964544WikidataQ127829919 ScholiaQ127829919MaRDI QIDQ2312648

Brahim Benmedjdoub, Isma Bouchemakh, Eric Sopena

Publication date: 17 July 2019

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

Full work available at URL: https://arxiv.org/abs/1705.01744

zbMATH Keywords

Halin graphlist colouringsquare gridHamiltonian cubic graphincidence colouringincidence list colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Hypergraph incidence coloring ⋮ Defective incidence coloring of graphs ⋮ On incidence choosability of cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On incidence coloring conjecture in Cartesian products of graphs
• Incidence coloring of pseudo-Halin graphs
• Invalid proofs on incidence coloring
• Some results on the incidence coloring number of a graph
• Incidence and strong edge colorings of graphs
• Choosability of powers of circuits
• The incidence coloring conjecture for graphs of maximum degree 3
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• On incidence choosability of cubic graphs
• Note on incidence chromatic number of subquartic graphs
• The incidence chromatic number of toroidal grids
• Graph colorings with local constraints -- a survey

This page was built for publication: Incidence choosability of graphs