Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2023.127842 / rank
Normal rank
 
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.amc.2023.127842 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4317810520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence trees and Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with at most 4 leaves in \(K_{1, 5}\)-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: Spanning 5-ended trees in \(K_{1,5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Las Vergnas concerning certain spanning trees in graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2023.127842 / rank
 
Normal rank

Latest revision as of 20:25, 19 December 2024

scientific article
Language Label Description Also known as
English
Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
scientific article

    Statements

    Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2023
    0 references
    spanning tree
    0 references
    leaf
    0 references
    independence number
    0 references
    \(K_{1,r}\)-free
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references