Graphs with no P<inf>7</inf>-minor
© 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.
Saved in:
Main Authors: | Guoli Ding, Chanun Lewchalermvongs, John Maharry |
---|---|
Other Authors: | Louisiana State University |
Format: | Article |
Published: |
2018
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/43546 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
Internally 4-Connected Graphs with No {Cube, V<inf>8</inf>}-Minor
by: Chanun Lewchalermvongs, et al.
Published: (2022) -
Domination game played on a graph constructed from 1-sum of paths
by: Chutchawon Weeranukujit, et al.
Published: (2020) -
Constacyclic codes of length np<sup>s</sup>over F<inf>p</inf>m + uF<inf>p</inf>m
by: Yonglin Cao, et al.
Published: (2018) -
Cyclic DNA codes over the ring F<inf>2</inf>+ uF<inf>2</inf>+ vF<inf>2</inf>+ uvF<inf>2</inf>+ v<sup>2</sup>F<inf>2</inf>+ uv<sup>2</sup>F<inf>2</inf>
by: Hai Q. Dinh, et al.
Published: (2018) -
Structural and superconducting properties of RE<inf>1-2x</inf>Pr<inf>x</inf>Ca<inf>x</inf>Sr<inf>0.8</inf>Ba<inf>1.2</inf>Cu<inf>3</inf>o<inf>7-δ</inf>(RE = Er and Gd) high T<inf>c</inf>superconductors
by: N. Charoenthai, et al.
Published: (2018)