List injective coloring of embedded graphs with no intersecting 6-cycles

zbMATH Open1399.05066MaRDI QIDQ3175960FDOQ3175960

Authors: Hongyu Chen, Jianming Qi 

Publication date: 18 July 2018

Recommendations

• The list injective coloring of embedded graphs with girth at least six
• List injective coloring of planar graphs with girth \(g \geq 6\)
• List injective coloring of planar graphs
• List injective coloring of planar graphs.
• List injective coloring of planar graphs with disjoint \(5^-\)-cycles

zbMATH Keywords

girthembedded graphlist injective coloring

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• The list injective coloring of embedded graphs with girth at least six

This page was built for publication: List injective coloring of embedded graphs with no intersecting 6-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3175960)