On incidence choosability of cubic graphs

DOI10.1016/j.disc.2019.03.004zbMath1414.05118arXiv1804.06036OpenAlexW2964184200MaRDI QIDQ1999751

Boram Park, Sungsik Kang

Publication date: 27 June 2019

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

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

zbMATH Keywords

cubic graphincidence coloringstrong edge coloringincidence choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

List strong edge-colorings of sparse graphs ⋮ Incidence choosability of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On incidence coloring conjecture in Cartesian products of graphs
• The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
• Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• Interval incidence coloring of subcubic graphs
• Incidence coloring of pseudo-Halin graphs
• A note on the strong chromatic index of bipartite graphs
• Invalid proofs on incidence coloring
• Some results on the incidence coloring number of a graph
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• On incidence coloring for some cubic graphs
• On incidence coloring of complete multipartite and semicubic bipartite graphs
• The incidence coloring conjecture for graphs of maximum degree 3
• The star arboricity of graphs
• Incidence choosability of graphs
• Note on incidence chromatic number of subquartic graphs
• NP-completeness of 4-incidence colorability of semi-cubic graphs
• The incidence chromatic number of toroidal grids
• Strong Chromatic Index of Chordless Graphs

This page was built for publication: On incidence choosability of cubic graphs