Every 3-connected essentially 10-connected line graph is Hamilton-connected (Q1759410): 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: Q4873803 / 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: Every 3-connected, essentially 11-connected line graph is Hamiltonian / 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: On a closure concept in 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: Collapsible graphs and Hamiltonian connectedness of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity of 3-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 22:26, 5 July 2024

scientific article
Language Label Description Also known as
English
Every 3-connected essentially 10-connected line graph is Hamilton-connected
scientific article

    Statements

    Every 3-connected essentially 10-connected line graph is Hamilton-connected (English)
    0 references
    0 references
    0 references
    20 November 2012
    0 references
    super-Eulerian graph
    0 references
    Hamiltonian line graph
    0 references
    edge-disjoint spanning tree
    0 references

    Identifiers