Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs (Q3439314): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ming-Chu Li / rank
Normal rank
 
Property / author
 
Property / author: Ming-Chu Li / 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.endm.2005.06.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2175573133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and minimum degree in 3-connected claw-free graphs / 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: Eulerian subgraphs containing given vertices and hamiltonian line graphs / 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: Hamiltonicity in 3-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian connectedness in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumferences and Minimum Degrees in 3-Connected Claw-Free 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:08, 25 June 2024

scientific article
Language Label Description Also known as
English
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
scientific article

    Statements

    Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    circumference
    0 references
    longest cycle
    0 references
    claw-free graph
    0 references
    0 references