Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Δ-List Vertex Coloring in Linear Time

From MaRDI portal
Publication:3046497
Jump to:navigation, search

DOI10.1007/3-540-45471-3_25zbMath1078.05529OpenAlexW327495823MaRDI QIDQ3046497

San Skulrattanakulchai

Publication date: 12 August 2004

Published in: Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45471-3_25



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (4)

Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines ⋮ Brooks' theorem for generalized dart graphs ⋮ COLORING ALGORITHMS ON SUBCUBIC GRAPHS ⋮ Dichotomy for Coloring of Dart Graphs







This page was built for publication: Δ-List Vertex Coloring in Linear Time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3046497&oldid=16087493"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki