The Matching Extendability of Optimal 1-Planar Graphs

Jun Fujisawa, Keita Segawa, Yusuke Suzuki

Research output: Contribution to journalArticle

Abstract

A graph G is said to be 1-planar if it can be drawn on the sphere or plane so that any edge of G has at most one crossing point with another edge. Moreover, G is called an optimal 1-planar graph if | E(G) | = 4 | V(G) | - 8. In this paper, we investigate the matching extendability of optimal 1-planar graphs. It is shown that every optimal 1-planar graph G of even order is 2-extendable unless G contains a 4-cycle C which separates the graph into two odd components. Moreover, for any 5-connected optimal 1-planar graph, we characterize a matching with three edges which is not extendable.

Original languageEnglish
JournalGraphs and Combinatorics
DOIs
Publication statusAccepted/In press - 2018 Jan 1

Fingerprint

Extendability
Planar graph
Graph in graph theory
Odd
Cycle

Keywords

  • Extendability
  • Optimal 1-planar graph
  • Perfect matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

The Matching Extendability of Optimal 1-Planar Graphs. / Fujisawa, Jun; Segawa, Keita; Suzuki, Yusuke.

In: Graphs and Combinatorics, 01.01.2018.

Research output: Contribution to journalArticle

@article{0ebc31fc5ecb42868bd99c7215f71740,
title = "The Matching Extendability of Optimal 1-Planar Graphs",
abstract = "A graph G is said to be 1-planar if it can be drawn on the sphere or plane so that any edge of G has at most one crossing point with another edge. Moreover, G is called an optimal 1-planar graph if | E(G) | = 4 | V(G) | - 8. In this paper, we investigate the matching extendability of optimal 1-planar graphs. It is shown that every optimal 1-planar graph G of even order is 2-extendable unless G contains a 4-cycle C which separates the graph into two odd components. Moreover, for any 5-connected optimal 1-planar graph, we characterize a matching with three edges which is not extendable.",
keywords = "Extendability, Optimal 1-planar graph, Perfect matching",
author = "Jun Fujisawa and Keita Segawa and Yusuke Suzuki",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/s00373-018-1932-6",
language = "English",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",

}

TY - JOUR

T1 - The Matching Extendability of Optimal 1-Planar Graphs

AU - Fujisawa, Jun

AU - Segawa, Keita

AU - Suzuki, Yusuke

PY - 2018/1/1

Y1 - 2018/1/1

N2 - A graph G is said to be 1-planar if it can be drawn on the sphere or plane so that any edge of G has at most one crossing point with another edge. Moreover, G is called an optimal 1-planar graph if | E(G) | = 4 | V(G) | - 8. In this paper, we investigate the matching extendability of optimal 1-planar graphs. It is shown that every optimal 1-planar graph G of even order is 2-extendable unless G contains a 4-cycle C which separates the graph into two odd components. Moreover, for any 5-connected optimal 1-planar graph, we characterize a matching with three edges which is not extendable.

AB - A graph G is said to be 1-planar if it can be drawn on the sphere or plane so that any edge of G has at most one crossing point with another edge. Moreover, G is called an optimal 1-planar graph if | E(G) | = 4 | V(G) | - 8. In this paper, we investigate the matching extendability of optimal 1-planar graphs. It is shown that every optimal 1-planar graph G of even order is 2-extendable unless G contains a 4-cycle C which separates the graph into two odd components. Moreover, for any 5-connected optimal 1-planar graph, we characterize a matching with three edges which is not extendable.

KW - Extendability

KW - Optimal 1-planar graph

KW - Perfect matching

UR - http://www.scopus.com/inward/record.url?scp=85051283740&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85051283740&partnerID=8YFLogxK

U2 - 10.1007/s00373-018-1932-6

DO - 10.1007/s00373-018-1932-6

M3 - Article

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

ER -