Hamilton cycles in 5-connected line graphs (Q412285): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing a hypergraph into \(k\) connected sub-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connectivity of line graphs and claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles Intersecting Edge-Cuts of Prescribed Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of Fleischner's and Thomassen's conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint trees containing some given vertices in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint Steiner trees in graphs without large bridges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 3-connected, essentially 11-connected line graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian subgraphs and Hamilton-connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposabler-graphs and some other counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity of 6-connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian line graphs and connectivity / rank
 
Normal rank

Latest revision as of 04:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Hamilton cycles in 5-connected line graphs
scientific article

    Statements

    Hamilton cycles in 5-connected line graphs (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    conjecture of Carsten Thomassen
    0 references
    0 references
    0 references