The subgraph homeomorphism problem for small wheels (Q1117247): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology of series-parallel networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on primitive skew curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The subgraph homeomorphism problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Functions of Bounded Second Variation and Stieltjes-Type Integrals / rank | |||
Normal rank |
Latest revision as of 14:30, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The subgraph homeomorphism problem for small wheels |
scientific article |
Statements
The subgraph homeomorphism problem for small wheels (English)
0 references
1988
0 references
The author quickly shows that every vertex of degree at least 4 in a 3- connected graph is the ``hub'' of a subdivision of a wheel with four spokes. Using this result he then proves, by extensive case analysis, that a graph G contains a subdivision of a 5-spoked wheel if it is 3- connected, has a vertex v of degree 5 and a cycle of length at least 5 that does not contain v, and does not have a set E of three edges such that each component of G-E has more than one vertex.
0 references
hub
0 references
subdivision of a wheel
0 references