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

Simple item page
dc.contributor.authorGuoli Dingen_US
dc.contributor.authorChanun Lewchalermvongsen_US
dc.contributor.authorJohn Maharryen_US
dc.contributor.otherLouisiana State Universityen_US
dc.contributor.otherMahidol Universityen_US
dc.contributor.otherOhio State Universityen_US
dc.date.accessioned2018-12-11T02:39:21Z
dc.date.accessioned2019-03-14T08:04:36Z
dc.date.available2018-12-11T02:39:21Z
dc.date.available2019-03-14T08:04:36Z
dc.date.issued2016-04-15en_US
dc.description.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.en_US
dc.identifier.citationElectronic Journal of Combinatorics. Vol.23, No.2 (2016)en_US
dc.identifier.issn10778926en_US
dc.identifier.other2-s2.0-84963864069en_US
dc.identifier.urihttps://repository.li.mahidol.ac.th/handle/20.500.14594/43546
dc.rightsMahidol Universityen_US
dc.rights.holderSCOPUSen_US
dc.source.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84963864069&origin=inwarden_US
dc.subjectComputer Scienceen_US
dc.subjectMathematicsen_US
dc.titleGraphs with no P<inf>7</inf>-minoren_US
dc.typeArticleen_US
dspace.entity.typePublication
mu.datasource.scopushttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84963864069&origin=inwarden_US

Files

Collections

Scopus 2016-2017