Leaf number and Hamiltonian \(C_4\)-free graphs (Q1693960): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimal spanning trees with a constraint on the number of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree, leaf number and traceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for a graph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing full spanning trees for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Degree, Leaf Number, and Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning cycles, paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves and average distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Ore's Theorem involving neighborhood unions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for graphs with large neighborhood unions to be traceable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in 2‐connected claw‐free‐graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood unions and hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbourhood unions and Hamiltonian properties in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank

Latest revision as of 01:53, 15 July 2024

scientific article
Language Label Description Also known as
English
Leaf number and Hamiltonian \(C_4\)-free graphs
scientific article

    Statements

    Leaf number and Hamiltonian \(C_4\)-free graphs (English)
    0 references
    1 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    leaf number
    0 references
    minimum degree
    0 references
    Hamiltonicity
    0 references
    \(C_4\)-free graphs
    0 references
    0 references
    0 references