The matching extendability of optimal 1-planar graphs
type: Item
instance of: scholarly article
title: The matching extendability of optimal 1-planar graphs
zbMATH Open document ID: 1402.05045
author: Jun Fujisawa
author: Keita Segawa
author: Yusuke Suzuki
published in: Graphs and Combinatorics
publication date: 2019-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 7000617
zbMATH Keywords: optimal 1-planar graph
zbMATH Keywords: perfect matching
zbMATH Keywords: extendability
MaRDI profile type: Publication
full work available at URL: s00373-018-1932-6
OpenAlex ID: W2887184711
cites work: On the matching extendability of graphs in surfaces
cites work: Q4820780
cites work: Proximity thresholds for matching extension in planar and projective planar triangulations
cites work: Outer 1-planar graphs
cites work: A linear-time algorithm for 7-coloring 1-plane graphs
cites work: On drawings and decompositions of 1-planar graphs
cites work: Q3577833
cites work: The structure of 1-planar graphs
cites work: The 2-extendability of 5-connected graphs on surfaces with large representativity
cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
cites work: Relationship among triangulations, quadrangulations and optimal 1-planar graphs
cites work: Q4732491
cites work: Extending matchings in planar graphs. IV
cites work: Recent Progress in Matching Extension
cites work: Ein Sechsfarbenproblem auf der Kugel
cites work: Re-embeddings of Maximum 1-Planar Graphs
cites work: 4-connected projective planar graphs are Hamiltonian
Wikidata QID: Q129380118
DOI: 10.1007/S00373-018-1932-6
description: scientific article; zbMATH DE number 7000617