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

Algorithmic Aspects of Partial List Colourings

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

DOI10.1017/S0963548300004259zbMath0959.05039OpenAlexW2151257523MaRDI QIDQ2703027

No author found.

Publication date: 20 April 2001

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300004259


zbMATH Keywords

bipartite graphchromatic numberlist chromatic numberconditional probabilities


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (1)

Partial Online List Coloring of Graphs







This page was built for publication: Algorithmic Aspects of Partial List Colourings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2703027&oldid=15544385"
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 11:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki