(1,λ)-EMBEDDED GRAPHS AND THE ACYCLIC EDGE CHOOSABILITY

DOI10.4134/BKMS.2012.49.3.573zbMath1242.05186arXiv1106.4681OpenAlexW2035658878MaRDI QIDQ2890349

Xin Zhang, Gui Zhen Liu, Jian Liang Wu

Publication date: 8 June 2012

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

(\(1\(\alpha\)-linear graph\lambda\))-embedded graphacyclic edge choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

On edge colorings of 1-toroidal graphs ⋮ Counting cliques in 1-planar graphs ⋮ On total colorings of 1-planar graphs

This page was built for publication: (1,λ)-EMBEDDED GRAPHS AND THE ACYCLIC EDGE CHOOSABILITY