On covering vertices of a graph by trees (Q941380): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the largest tree of given maximum degree in a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Greene's theorem to directed graphs / 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: A homology theory for spanning tress of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen / rank
 
Normal rank

Latest revision as of 15:11, 28 June 2024

scientific article
Language Label Description Also known as
English
On covering vertices of a graph by trees
scientific article

    Statements

    Identifiers