On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs

DOI10.1007/s40840-023-01601-3zbMath1527.05107OpenAlexW4388498778MaRDI QIDQ6090829

Yuan Qiu Huang, Guiping Wang, Licheng Zhang

Publication date: 20 November 2023

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-023-01601-3

zbMATH Keywords

edge-connectivity1-planar graphrestricted edge-connectivityoptimal 1-planar graphminimum edge-cut

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On drawings and decompositions of 1-planar graphs
• A note on 1-planar graphs
• On partitioning the edges of 1-plane graphs
• The edge chromatic number of outer-1-planar graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
• Extraconnectivity of graphs with large girth
• Recognizing optimal 1-planar graphs in linear time
• The matching extendability of optimal 1-planar graphs
• Density of straight-line 1-planar graph drawings
• The maximal 1-planarity and crossing numbers of graphs
• Counting cliques in 1-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• \(K_7\)-minors in optimal 1-planar graphs
• Facially-constrained colorings of plane graphs: a survey
• An annotated bibliography on 1-planarity
• On properties of maximal 1-planar graphs
• The Book Embedding Problem from a SAT-Solving Perspective
• Re-embeddings of Maximum 1-Planar Graphs
• Über 1-optimale Graphen
• Conditional connectivity
• A simple min-cut algorithm
• A new proof of the 6 color theorem
• Beyond Planar Graphs: Introduction
• On the Size of Matchings in 1-Planar Graph with High Minimum Degree
• Light edges in 1‐planar graphs
• Matchings in 1‐planar graphs with large minimum degree
• The maximum matching extendability and factor-criticality of 1-planar graphs