Collapsible graphs and Hamiltonicity of line graphs (Q742590): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without spanning closed trails / 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: On computing a conditional edge-connectivity of a graph / 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: On hamiltonian line graphs and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in 5-connected line graphs / 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: Hamiltonian connectedness in 3-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: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapsible graphs and Hamiltonicity of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity of 6-connected line graphs / rank
 
Normal rank

Latest revision as of 02:13, 9 July 2024

scientific article
Language Label Description Also known as
English
Collapsible graphs and Hamiltonicity of line graphs
scientific article

    Statements

    Collapsible graphs and Hamiltonicity of line graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Thomassen's conjecture
    0 references
    line graph
    0 references
    supereulerian graph
    0 references
    collapsible graph
    0 references
    Hamiltonian graph
    0 references
    dominating Eulerian subgraph
    0 references
    0 references