Graphs with no P7-minor

Guoli Ding; Chanun Lewchalermvongs; John Maharry

Graphs with no P₇-minor

Guoli Ding, Chanun Lewchalermvongs, John Maharry

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

Abstract

Let P₇ denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain P₇ as a minor.

Original language	English
Article number	P2.16
Journal	Electronic Journal of Combinatorics
Volume	23
Issue number	2
Publication status	Published - 15 Apr 2016
Externally published	Yes

Keywords

4-connected graph
Forbidden minor

Cite this

@article{70680b98ad734af1ba9f3c4f563f81e4,

title = "Graphs with no P7-minor",

abstract = "Let P7 denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain P7 as a minor.",

keywords = "4-connected graph, Forbidden minor",

author = "Guoli Ding and Chanun Lewchalermvongs and John Maharry",

year = "2016",

month = apr,

day = "15",

language = "English",

volume = "23",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

number = "2",

}

TY - JOUR

T1 - Graphs with no P7-minor

AU - Ding, Guoli

AU - Lewchalermvongs, Chanun

AU - Maharry, John

PY - 2016/4/15

Y1 - 2016/4/15

N2 - Let P7 denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain P7 as a minor.

AB - Let P7 denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain P7 as a minor.

KW - 4-connected graph

KW - Forbidden minor

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

M3 - Article

AN - SCOPUS:84963864069

SN - 1077-8926

VL - 23

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 2

M1 - P2.16

ER -

Graphs with no P₇-minor

Abstract

Keywords

Other files and links

Fingerprint

Cite this