On minimum degree, leaf number, traceability and Hamiltonicity in graphs (Q512550): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: T. P. Kirkman, Mathematician / 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: Some Theorems on Abstract Graphs / rank
 
Normal rank
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: Q4198056 / 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: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many 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: 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: DEGREE DISTANCE AND MINIMUM DEGREE / rank
 
Normal rank

Latest revision as of 12:12, 13 July 2024

scientific article
Language Label Description Also known as
English
On minimum degree, leaf number, traceability and Hamiltonicity in graphs
scientific article

    Statements

    On minimum degree, leaf number, traceability and Hamiltonicity in graphs (English)
    0 references
    0 references
    0 references
    27 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum degree
    0 references
    leaf number
    0 references
    spanning paths and cycles
    0 references
    0 references