Non-1-planarity of lexicographic products of graphs

DOI10.7151/dmgt.2231zbMath1468.05052OpenAlexW2955946848WikidataQ127563740 ScholiaQ127563740MaRDI QIDQ2042623

Yusuke Suzuki, Naoki Matsumoto

Publication date: 21 July 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2231

zbMATH Keywords

lexicographic product1-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ 1-embeddability of complete multipartite graphs on the projective plane

Cites Work

• Unnamed Item
• 1-planarity of complete multipartite graphs
• Joins of 1-planar graphs
• Coloring vertices and faces of locally planar graphs
• An annotated bibliography on 1-planarity
• Minimal non-1-planar graphs
• Re-embeddings of Maximum 1-Planar Graphs
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing

This page was built for publication: Non-1-planarity of lexicographic products of graphs