Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges

Zhongyuan Che, Zhibo Chen

Research output: Contribution to journalArticle

Abstract

Let G be a plane elementary bipartite graph with more than one finite face. We first characterize forcing edges and anti-forcing edges of G in terms of handles and forcing faces. We then introduce the concept of a nice pair of faces of G, which allows us to provide efficient algorithms to construct plane minimal elementary bipartite graphs from G. We show that if G is a minimal elementary spanning subgraph of G, then all vertices of a forcing face of G are contained in a forcing face of G, and any forcing face of G is a forcing face of G if it is still a face of G. Furthermore, any forcing edge (resp., anti-forcing edge) of G is still a forcing edge (resp., an anti-forcing edge) of G if it is still an edge of G. We conclude the paper with the co-existence property of forcing edges and anti-forcing edges for those plane minimal elementary bipartite graphs that remain 2-connected when any handle of length one (if exists) is deleted.

Original languageEnglish (US)
Pages (from-to)959-971
Number of pages13
JournalGraphs and Combinatorics
Volume35
Issue number4
DOIs
StatePublished - Jul 1 2019

Fingerprint

Bipartite Graph
Forcing
Face
Spanning Subgraph
Coexistence
Efficient Algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

@article{6763ce83c74942c6a528c4dbf7f8b747,
title = "Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges",
abstract = "Let G be a plane elementary bipartite graph with more than one finite face. We first characterize forcing edges and anti-forcing edges of G in terms of handles and forcing faces. We then introduce the concept of a nice pair of faces of G, which allows us to provide efficient algorithms to construct plane minimal elementary bipartite graphs from G. We show that if G′ is a minimal elementary spanning subgraph of G, then all vertices of a forcing face of G are contained in a forcing face of G′, and any forcing face of G is a forcing face of G′ if it is still a face of G′. Furthermore, any forcing edge (resp., anti-forcing edge) of G is still a forcing edge (resp., an anti-forcing edge) of G′ if it is still an edge of G′. We conclude the paper with the co-existence property of forcing edges and anti-forcing edges for those plane minimal elementary bipartite graphs that remain 2-connected when any handle of length one (if exists) is deleted.",
author = "Zhongyuan Che and Zhibo Chen",
year = "2019",
month = "7",
day = "1",
doi = "10.1007/s00373-019-02051-0",
language = "English (US)",
volume = "35",
pages = "959--971",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "4",

}

Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges. / Che, Zhongyuan; Chen, Zhibo.

In: Graphs and Combinatorics, Vol. 35, No. 4, 01.07.2019, p. 959-971.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges

AU - Che, Zhongyuan

AU - Chen, Zhibo

PY - 2019/7/1

Y1 - 2019/7/1

N2 - Let G be a plane elementary bipartite graph with more than one finite face. We first characterize forcing edges and anti-forcing edges of G in terms of handles and forcing faces. We then introduce the concept of a nice pair of faces of G, which allows us to provide efficient algorithms to construct plane minimal elementary bipartite graphs from G. We show that if G′ is a minimal elementary spanning subgraph of G, then all vertices of a forcing face of G are contained in a forcing face of G′, and any forcing face of G is a forcing face of G′ if it is still a face of G′. Furthermore, any forcing edge (resp., anti-forcing edge) of G is still a forcing edge (resp., an anti-forcing edge) of G′ if it is still an edge of G′. We conclude the paper with the co-existence property of forcing edges and anti-forcing edges for those plane minimal elementary bipartite graphs that remain 2-connected when any handle of length one (if exists) is deleted.

AB - Let G be a plane elementary bipartite graph with more than one finite face. We first characterize forcing edges and anti-forcing edges of G in terms of handles and forcing faces. We then introduce the concept of a nice pair of faces of G, which allows us to provide efficient algorithms to construct plane minimal elementary bipartite graphs from G. We show that if G′ is a minimal elementary spanning subgraph of G, then all vertices of a forcing face of G are contained in a forcing face of G′, and any forcing face of G is a forcing face of G′ if it is still a face of G′. Furthermore, any forcing edge (resp., anti-forcing edge) of G is still a forcing edge (resp., an anti-forcing edge) of G′ if it is still an edge of G′. We conclude the paper with the co-existence property of forcing edges and anti-forcing edges for those plane minimal elementary bipartite graphs that remain 2-connected when any handle of length one (if exists) is deleted.

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

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

U2 - 10.1007/s00373-019-02051-0

DO - 10.1007/s00373-019-02051-0

M3 - Article

AN - SCOPUS:85066632957

VL - 35

SP - 959

EP - 971

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 4

ER -