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

A note on list-coloring powers of graphs

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

DOI10.1016/j.disc.2014.05.008zbMath1298.05123arXiv1309.7705OpenAlexW1979646850MaRDI QIDQ400353

Elyse Yeager, Nicholas Kosar, Sarka Petrickova, Benjamin Reiniger

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.7705


zbMATH Keywords

choosabilitylist coloringchromatic-choosablegraph powers


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)


Related Items (4)

Chromatic-choosability of the power of graphs ⋮ Bipartite graphs whose squares are not chromatic-choosable ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ A Proof of a Conjecture of Ohba



Cites Work

  • Chromatic-choosability of the power of graphs
  • Choice Numbers of Graphs: a Probabilistic Approach
  • Choosability conjectures and multicircuits
  • Unnamed Item


This page was built for publication: A note on list-coloring powers of graphs

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