A parity theorem about trees with specified degrees (Q2235250): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2021.08.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3197202779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity results on connected f-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graphic uses of an even number of odd nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles containing all the odd-degree vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple algorithm for finding a second Hamilton cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding a second Hamiltonian cycle in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chords in longest cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of a Euler graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5110817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE / rank
 
Normal rank

Latest revision as of 20:39, 26 July 2024

scientific article
Language Label Description Also known as
English
A parity theorem about trees with specified degrees
scientific article

    Statements

    A parity theorem about trees with specified degrees (English)
    0 references
    0 references
    21 October 2021
    0 references
    parity theorem
    0 references
    tree
    0 references
    Hamiltonian cycle
    0 references
    exchange graph
    0 references
    lollipop algorithm
    0 references
    Smith's theorem
    0 references
    polynomial parity argument
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references