Upper bound for linear arboricity (Q809087): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Systems of Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the chromatic number of a graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0893-9659(91)90054-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081202192 / rank
 
Normal rank

Latest revision as of 09:44, 30 July 2024

scientific article
Language Label Description Also known as
English
Upper bound for linear arboricity
scientific article

    Statements