Spanning paths in graphs (Q1727750): 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.dam.2018.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889169898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in graphs with prescribed toughness and minimum degree / 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: Q5477958 / 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: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest cycles in a graph G with minimum degree at least \(| G| /k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems involving neighborhood unions / 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 with many leaves in cubic graphs / 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: Longest cycles in tough graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of length of longest cycles in graphs involving neighborhood unions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum degree, leaf number, traceability and Hamiltonicity in 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: Minimum degree, leaf number and traceability / 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
Property / cites work
 
Property / cites work: Q5628163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length of longest cycles in a graph whose relative length is at least two / 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: Q5494200 / 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: Traceability of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumference and girth / rank
 
Normal rank

Latest revision as of 08:09, 18 July 2024

scientific article
Language Label Description Also known as
English
Spanning paths in graphs
scientific article

    Statements

    Spanning paths in graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    leaf number
    0 references
    minimum degree
    0 references
    traceable graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers