On incidence coloring conjecture in Cartesian products of graphs

DOI10.1016/j.dam.2016.04.030zbMath1344.05117arXiv1505.04908OpenAlexW2355202049WikidataQ123191967 ScholiaQ123191967MaRDI QIDQ313802

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

Publication date: 12 September 2016

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

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

zbMATH Keywords

Cartesian productincidence coloringlocally injective homomorphism

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (8)

Note on incidence chromatic number of subquartic graphs ⋮ On incidence coloring of graph fractional powers ⋮ Strong incidence coloring of outerplanar graphs ⋮ Hypergraph incidence coloring ⋮ Unnamed Item ⋮ On incidence choosability of cubic graphs ⋮ Incidence coloring of mycielskians with fast algorithm ⋮ Incidence choosability of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incidence coloring on hypercubes
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Invalid proofs on incidence coloring
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• The incidence coloring conjecture for graphs of maximum degree 3
• The incidence coloring numbers of meshes
• The star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• Incidence coloring of regular graphs and complement graphs
• Incidence coloring of Cartesian product graphs
• The incidence chromatic number of toroidal grids

This page was built for publication: On incidence coloring conjecture in Cartesian products of graphs