On the Size of Matchings in 1-Planar Graph with High Minimum Degree

DOI10.1137/21M1459952zbMath1503.05027arXiv2207.03747MaRDI QIDQ5046627

Yuan Qiu Huang, Zhang Dong Ouyang, Fengming Dong

Publication date: 9 November 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matchingdrawingminimum degree1-planar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ A new note on 1-planar graphs with minimum degree 7

Cites Work

• Unnamed Item
• Unnamed Item
• 1-planarity of complete multipartite graphs
• An upper bound on the number of edges in an almost planar bipartite graph
• The structure of 1-planar graphs
• Matching theory
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Graphs drawn with few crossings per edge
• On the sizes of bipartite 1-planar graphs
• Non-1-planarity of lexicographic products of graphs
• Finding large matchings in 1-planar graphs of minimum degree 3
• A note on 1-planar graphs with minimum degree 7
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Minimal non-1-planar graphs
• Über 1-optimale Graphen
• Matchings in 1‐planar graphs with large minimum degree

This page was built for publication: On the Size of Matchings in 1-Planar Graph with High Minimum Degree