A \(k\)-tree containing specified vertices (Q604665): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cyclability and pancyclability in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through subsets with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through given vertices and closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree bounded spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500706 / 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: Degree conditions and degree bounded trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a \(k\)-tree containing specified leaves in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with bounded degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through prescribed vertices with large degree sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition concerning the connectivity and the independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a connection between the existence of k-trees and the toughness of a graph / rank
 
Normal rank

Latest revision as of 11:49, 3 July 2024

scientific article
Language Label Description Also known as
English
A \(k\)-tree containing specified vertices
scientific article

    Statements

    A \(k\)-tree containing specified vertices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 November 2010
    0 references
    0 references
    \(k\)-tree
    0 references
    degree sum
    0 references
    specified vertices
    0 references
    0 references