1-planarity of complete multipartite graphs

DOI10.1016/J.DAM.2011.11.014zbMATH Open1239.05039OpenAlexW2080939450MaRDI QIDQ412349FDOQ412349

Dávid Hudák, Július Czap

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.014

Recommendations

• Drawing complete multipartite graphs on the plane with restrictions on crossings
• On drawings and decompositions of 1-planar graphs
• On properties of maximal 1-planar graphs
• The structure of 1-planar graphs
• 1-embeddability of complete multipartite graphs on the projective plane

zbMATH Keywords

1-planar graphcomplete \(k\)-partite graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Efficient Planarity Testing
• Title not available (Why is that?)
• A new proof of the 6 color theorem
• Graphs drawn with few crossings per edge
• Ein Sechsfarbenproblem auf der Kugel
• The structure of 1-planar graphs
• Title not available (Why is that?)
• A linear-time algorithm for 7-coloring 1-plane graphs
• Minimal non-1-planar graphs
• Title not available (Why is that?)
• Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
• The crossing number of \(K_{1,4,n}\)
• Title not available (Why is that?)
• The crossing number of K5,n

Cited In (28)

• Packing Trees into 1-planar Graphs
• On drawings and decompositions of 1-planar graphs
• A note on 1-planar graphs
• 1-Planar Graphs
• Generalized cut and metric polytopes of graphs and simplicial complexes
• Title not available (Why is that?)
• Light edges in 3-connected 2-planar graphs with prescribed minimum degree
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• An upper bound on the sum of powers of the degrees of simple 1-planar graphs
• On the sizes of bipartite 1-planar graphs
• 1-embeddability of complete multipartite graphs on the projective plane
• Non-1-planarity of lexicographic products of graphs
• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Joins of 1-planar graphs
• Title not available (Why is that?)
• Fan-planarity: properties and complexity
• Right angle crossing graphs and 1-planarity
• On quasi-planar graphs: clique-width and logical description
• On an extremal problem in the class of bipartite 1-planar graphs
• An annotated bibliography on 1-planarity
• Optimal 1-planar multigraphs
• Imprimitivity of locally finite, 1-ended, planar graphs
• On the Size of Matchings in 1-Planar Graph with High Minimum Degree
• From light edges to strong edge-colouring of 1-planar graphs
• Maximal 1-plane graphs with dominating vertices
• Drawing graph joins in the plane with restrictions on crossings
• Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
• Efficient generation of different topological representations of graphs beyond-planarity

This page was built for publication: 1-planarity of complete multipartite graphs

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