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

scientific article

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

zbMath1236.05077MaRDI QIDQ2883161

Elżbieta Sidorowicz, Piotr Borowiecki

Publication date: 11 May 2012

Full work available at URL: http://iospress.metapress.com/content/w227640503032482/fulltext.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsgraph coloringtreescritical graphsgreedy coloringGrundy numbergraph product


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (8)

Dynamic \(F\)-free coloring of graphs ⋮ Dynamic list coloring of 1-planar graphs ⋮ Computational aspects of greedy partitioning of graphs ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ New potential functions for greedy independence and coloring ⋮ Dynamic graph coloring ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs




This page was built for publication:

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