Matchings in 1‐planar graphs with large minimum degree

DOI10.1002/jgt.22736zbMath1522.05057arXiv1911.04603OpenAlexW3198018639MaRDI QIDQ6056806

John Wittnebel, Therese C. Biedl

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

maximum matchingminimum degree1-planar graphTutte-Berge theorem

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)

Related Items

On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ A new note on 1-planar graphs with minimum degree 7

Cites Work

• Unnamed Item
• Unnamed Item
• Toughness and Delaunay triangulations
• Matching theory
• Lower bounds on the cardinality of the maximum matchings of planar 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
• Zur Struktur 1‐planarer Graphen
• Long cycles and spanning subgraphs of locally maximal 1‐planar graphs