Drawing graph joins in the plane with restrictions on crossings

DOI10.2298/FIL1702363CzbMath1488.05133arXiv1404.1222MaRDI QIDQ5005479

Peter Šugerek, Július Czap

Publication date: 10 August 2021

Published in: Filomat (Search for Journal in Brave)

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

zbMATH Keywords

crossing number1-planar graphjoin product

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

An annotated bibliography on 1-planarity ⋮ On morphing 1-planar drawings ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Remarks on the joins of 1-planar graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs

Cites Work

• 1-planarity of complete multipartite graphs
• Joins of 1-planar graphs
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• The structure of 1-planar graphs
• The structure of plane graphs with independent crossings and its applications to coloring problems
• On (p,1)-total labelling of plane graphs with independent crossings
• Coloring plane graphs with independent crossings
• The Join of Graphs and Crossing Numbers
• The crossing number ofK1,3,n andK2,3,n
• The crossing number of K5,n

This page was built for publication: Drawing graph joins in the plane with restrictions on crossings