Trees through specified vertices (Q1043624): 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.disc.2008.06.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068519723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest cycle of a graph with a large minimal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753979 / 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: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722819 / rank
 
Normal rank

Latest revision as of 07:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Trees through specified vertices
scientific article

    Statements