A characterization of internally 4-connected {P10− {v1,v2}}-minor-free graphs
Author(s) -
Xiaomin Zhou,
Weihua Yang,
Xiaxia Guan,
Chengfu Qin
Publication year - 2021
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2404
Subject(s) - mathematics , combinatorics , minor (academic) , characterization (materials science) , discrete mathematics , physics , optics , political science , law
Let P10 be the Petersen graph. Let V−−8 = P10 − {v1, v2}, where v1 and v2 are the adjacent vertices of P10. In this paper, all internally 4-connected graphs that do not contain V−−8 as a minor are charaterized.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom