Minimum order of graphs with given coloring parameters

DOI10.1016/j.disc.2014.12.002zbMath1305.05069DBLPjournals/dm/BacsoBHT15arXiv1312.7522OpenAlexW2031037985WikidataQ62043607 ScholiaQ62043607MaRDI QIDQ488290

Piotr Borowiecki, Mihály Hujter, Gábor Bacsó, Zsolt Tuza

Publication date: 23 January 2015

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

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

zbMATH Keywords

bipartite graphgreedy algorithmgraph coloringachromatic numberextremal graphGrundy number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Grundy number and products of graphs
• Some perfect coloring properties of graphs
• Graph with given achromatic number
• On-line coloring \(k\)-colorable graphs
• The complexity of harmonious colouring for trees
• On-line 3-chromatic graphs. II: Critical graphs
• Achromatic number is NP-complete for cographs and interval graphs
• Inequalities for the Grundy chromatic number of graphs
• On Approximating the Achromatic Number
• Approximation Algorithms for the Achromatic Number
• On the Grundy Number of a Graph
• New bounds for the chromatic number of graphs
• Edge Dominating Sets in Graphs
• On the pseudoachromatic number of a graph
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Further results on the achromatic number
• Graph Colorings
• Algorithms - ESA 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum order of graphs with given coloring parameters