Drawing complete multipartite graphs on the plane with restrictions on crossings

DOI10.1007/s10114-014-3763-6zbMath1304.05031arXiv1311.1994OpenAlexW2133295546MaRDI QIDQ477904

Xin Zhang

Publication date: 10 December 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

crossing number1-planar graphindependent crossings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (23)

Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ Recognizing and drawing IC-planar graphs ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ On RAC drawings of 1-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ Total coloring of outer-1-planar graphs with near-independent crossings ⋮ New results on edge partitions of 1-plane graphs ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Unnamed Item ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ On the sizes of bipartite 1-planar graphs ⋮ Remarks on the joins of 1-planar graphs ⋮ Linear arboricity of NIC-planar graphs ⋮ Equitable partition of plane graphs with independent crossings into induced forests ⋮ Drawing graph joins in the plane with restrictions on crossings ⋮ IC-Planar Graphs Are 6-Choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 1-planarity of complete multipartite graphs
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• The structure of plane graphs with independent crossings and its applications to coloring problems
• Ein Sechsfarbenproblem auf der Kugel
• The crossing number of \(K_{1,4,n}\)
• On (p,1)-total labelling of plane graphs with independent crossings
• Coloring plane graphs with independent crossings
• On the crossing number of some complete multipartite graphs
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• The crossing number ofK1,3,n andK2,3,n
• A new proof of the 6 color theorem
• The crossing number of K5,n

This page was built for publication: Drawing complete multipartite graphs on the plane with restrictions on crossings