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

Lower bounds on the sum choice number of a graph

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

DOI10.1016/J.ENDM.2016.05.036zbMath1347.05066OpenAlexW2508276897MaRDI QIDQ327690

Jochen Harant, Arnfried Kemnitz

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.036


zbMATH Keywords

coloringsum choice number


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)


Related Items (3)

Bounds for the sum choice number ⋮ Generalized sum List colorings of graphs ⋮ Comparison of sum choice number with chromatic sum




Cites Work

  • Sum list coloring block graphs
  • Sum list colorings of wheels
  • Sum choice numbers of some graphs
  • Sum list coloring graphs
  • Unnamed Item




This page was built for publication: Lower bounds on the sum choice number of a graph

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