Collapsible graphs and Hamiltonian connectedness of line graphs (Q444449): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hao Li / rank
Normal rank
 
Property / author
 
Property / author: Hao Li / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C76 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6065745 / rank
 
Normal rank
Property / zbMATH Keywords
 
Thomassen's conjecture
Property / zbMATH Keywords: Thomassen's conjecture / rank
 
Normal rank
Property / zbMATH Keywords
 
line graph
Property / zbMATH Keywords: line graph / rank
 
Normal rank
Property / zbMATH Keywords
 
super-Eulerian graph
Property / zbMATH Keywords: super-Eulerian graph / rank
 
Normal rank
Property / zbMATH Keywords
 
collapsible graph
Property / zbMATH Keywords: collapsible graph / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian line graph
Property / zbMATH Keywords: Hamiltonian line graph / rank
 
Normal rank
Property / zbMATH Keywords
 
dominating Eulerian subgraph
Property / zbMATH Keywords: dominating Eulerian subgraph / rank
 
Normal rank
Property / zbMATH Keywords
 
edge connectivity
Property / zbMATH Keywords: edge connectivity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.03.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167075033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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 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: 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: 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: Hamiltonicity of 3-connected line 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: Hamiltonicity of 6-connected line graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:08, 5 July 2024

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

    Statements

    Collapsible graphs and Hamiltonian connectedness of line graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Thomassen's conjecture
    0 references
    line graph
    0 references
    super-Eulerian graph
    0 references
    collapsible graph
    0 references
    Hamiltonian line graph
    0 references
    dominating Eulerian subgraph
    0 references
    edge connectivity
    0 references
    0 references