On some conjectures on cubic 3-connected graphs (Q914697): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123196147 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5575344 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Even cycles with prescribed chords in planar cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3832607 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4166780 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3734436 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5547252 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian cycles in cubic 3-connected bipartite planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3967559 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hamiltonian Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048871 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90294-r / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999108567 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:16, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On some conjectures on cubic 3-connected graphs |
scientific article |
Statements
On some conjectures on cubic 3-connected graphs (English)
0 references
1990
0 references
The authors reconsider certain properties of a special class of graphs. More specifically the graphs are cubic, 3-connected, finite, and loop- free, and the properties related to paths and can be formulated as the following three conjectures: 1) (Barnette) Every cubic 3-connected graphs is Hamiltonian. 2) (Jaeger) Every cubic cyclically 4-edge connected graph G has a cycle C such that G-V(C) is acyclic. 3) (Jackson, Fleisher) Every cubic cyclically 4-edge connected graph G has a cycle C such that V(G)-V(C) is an independent set of vertices. The authors show that these conjectures can be reformulated as the following three conjectures: 1') For every pair of edges belonging to the boundary of one given face of a cubic 3-connected bipartite planar graph, there exists a Hamilton cycle through these edges. 2') For every pair of non-adjacent edges of a cyclically 4-edge connected cubic graph G there exists a cycle C through these edges such that G-V(C) is acyclic. 3') For every pair of non-adjacent edges of a cyclically 4-edge connected cubic graph G there exists a cycle C through these edges such that V(G)- V(C) is an independent set of vertices. In addition to these refinements the authors present a number of auxiliary results most of them related to connectivity properties of graphs.
0 references
cubic 3-connected graphs
0 references
Hamiltonian
0 references
cubic cyclically 4-edge connected graph
0 references
cycle
0 references