Minimum order of graphs with given coloring parameters

DOI10.1016/J.DISC.2014.12.002zbMATH Open1305.05069DBLPjournals/dm/BacsoBHT15arXiv1312.7522OpenAlexW2031037985WikidataQ62043607 ScholiaQ62043607MaRDI QIDQ488290FDOQ488290

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

Publication date: 23 January 2015

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

Abstract: A complete $k$-coloring of a graph $G=(V,E)$ is an assignment $varphi:Vo1,ldots,k$ of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number $chi(G)$ and achromatic number $psi(G)$, respectively), and the Grundy number $Gamma(G)$ defined as the largest $k$ admitting a complete coloring $varphi$ with exactly $k$ colors such that every vertex $vinV$ of color $varphi(v)$ has a neighbor of color $i$ for all $1lei<varphi(v)$. The inequality chain $chi(G)leGamma(G)lepsi(G)$ obviously holds for all graphs $G$. A triple $(f,g,h)$ of positive integers at least 2 is called realizable if there exists a connected graph $G$ with $chi(G)=f$, $Gamma(G)=g$, and $psi(G)=h$. Chartrand et al. (A note on graphs with prescribed complete coloring numbers, J. Combin. Math. Combin. Comput. LXXIII (2010) 77-84) found the list of realizable triples. In this paper we determine the minimum number of vertices in a connected graph with chromatic number $f$, Grundy number $g$, and achromatic number $h$, for all realizable triples $(f,g,h)$ of integers. Furthermore, for $f=g=3$ we describe the (two) extremal graphs for each $hgeq6$. For $h=4$ and $5$, there are more extremal graphs, their description is contained as well.

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

zbMATH Keywords

greedy algorithmbipartite graphgraph coloringextremal graphGrundy numberachromatic number

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• The order of monochromatic subgraphs with a given minimum degree
• Title not available (Why is that?)
• Minimal colorings for properly colored subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimax relations for the partial q-colorings of a graph
• Graphs with least number of colorings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488290)