Spanning spiders and light-splitting switches (Q1877652): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999323173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal trees with bounded maximum degree in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity for <i>K</i><sub>1, r</sub>‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding long paths and cycles in sparse Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a graph to have a \(k\)-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest paths and cycles in K1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypohamiltonian and hypotraceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar cubic hypohamiltonian and hypotraceable graphs / rank
 
Normal rank

Latest revision as of 20:07, 6 June 2024

scientific article
Language Label Description Also known as
English
Spanning spiders and light-splitting switches
scientific article

    Statements

    Spanning spiders and light-splitting switches (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Spanning tree
    0 references
    Branch vertex
    0 references
    Hamilton path
    0 references
    0 references