Publication:
Graphs with no P<inf>7</inf>-minor

Issued Date

2016-04-15

Resource Type

Article

ISSN

10778926

Other identifier(s)

2-s2.0-84963864069

Rights

Mahidol University

Rights Holder(s)

SCOPUS

Bibliographic Citation

Electronic Journal of Combinatorics. Vol.23, No.2 (2016)

Suggested Citation

Guoli Ding, Chanun Lewchalermvongs, John Maharry Graphs with no P<inf>7</inf>-minor. Electronic Journal of Combinatorics. Vol.23, No.2 (2016). Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/43546

Research Projects

Organizational Units

Authors

Journal Issue

Thesis

Title

Graphs with no P<inf>7</inf>-minor

Author(s)

Guoli Ding
 Chanun Lewchalermvongs
 John Maharry

Other Contributor(s)

Louisiana State University
 Mahidol University
 Ohio State University

Abstract

© 2016, Australian National University. All rights reserved. Let P7denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain P7as a minor.

Keyword(s)

Computer Science
 Mathematics

Availability

URI

https://repository.li.mahidol.ac.th/handle/20.500.14594/43546

Collections

Scopus 2016-2017