Hamiltonian connectedness in 3-connected line graphs (Q1028425): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reduction of graph families closed under contraction / 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: Graph family operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873803 / 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: All 4-connected line graphs of claw free graphs are Hamiltonian connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751608 / rank
 
Normal rank

Latest revision as of 18:15, 1 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonian connectedness in 3-connected line graphs
scientific article

    Statements

    Hamiltonian connectedness in 3-connected line graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    0 references
    Hamiltonian connected
    0 references
    collapsible graphs
    0 references
    core graphs
    0 references
    hourglass
    0 references
    0 references