An upper bound for the chromatic number of line graphs (Q2461774): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andrew D. King / rank
 
Normal rank
Property / author
 
Property / author: Bruce A. Reed / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048900104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving a family of approximation algorithms to edge color multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4056033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of the chromatic index for multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $1.1$ Edge-Coloring of Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242948 / rank
 
Normal rank

Latest revision as of 12:20, 27 June 2024

scientific article
Language Label Description Also known as
English
An upper bound for the chromatic number of line graphs
scientific article

    Statements

    Identifiers