Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (Q998345): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizations of derived graphs / 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: Q3220629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832607 / 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: Equivalence of Fleischner's and Thomassen's conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888119 / 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: Contractibility techniques as a closure concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank

Latest revision as of 01:06, 29 June 2024

scientific article
Language Label Description Also known as
English
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
scientific article

    Statements

    Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    0 references
    dominating cycle
    0 references
    contractible graph
    0 references
    cubic graph
    0 references
    snark
    0 references
    line graph
    0 references
    Hamiltonian graph
    0 references
    0 references