<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" overflow="scroll"><mml:mo stretchy="false">[</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:math>-Chromatic numbers and hereditary properties of graphs

Similar Works

Action	Title	Year	Authors
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" overflow="scroll"><mml:mo stretchy="false">[</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:math>-Colorings of graphs	2006	Arnfried Kemnitz Massimiliano Marangio
+	Bounds for the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si44.gif" display="inline" overflow="scroll"><mml:mi>b</mml:mi></mml:math>-chromatic number of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si45.gif" display="inline" overflow="scroll"><mml:mi>G</mml:mi><mml:mo>−</mml:mo><mml:mi>v</mml:mi></mml:math>	2011	R. Balakrishnan S. Francis Raj
+	The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>b</mml:mi></mml:math>-chromatic number and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>f</mml:mi></mml:math>-chromatic vertex number of regular graphs	2014	Amine El Sahili Hamamache Kheddouci Mekkia Kouider Mortada Maidoun
+	Graphs of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml11" display="inline" overflow="scroll" altimg="si11.gif"><mml:mi>f</mml:mi></mml:math>-class 1	2017	Xia Zhang Jianfeng Hou Guizhen Liu Guiying Yan
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="script">P</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="script">Q</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-Total <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow…	2014	Arnfried Kemnitz Massimiliano Marangio Anja Pruchnewski Margit Voigt
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-chromatically connected graphs	2008	Andrzej Dudek Esmeralda Năstase Vojtěch Rödl
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e38" altimg="si28.gif"><mml:mi>r</mml:mi></mml:math>-hued colorings of graphs without short induced paths	2019	Hong‐Jian Lai Xuezheng Lv Murong Xu
+	Structure of some ( <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e108" altimg="si25.svg"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e118" altimg="si26.svg"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs with application to colorings	2024	Ran Chen Di Wu Baogang Xu
+	The chromatic number of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si21.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:math>-free graphs	2013	Louis Esperet Laetitia Lemoine Frédéric Maffray Grégory Morel
+	Upper bounds of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:mi>r</mml:mi></mml:math>-hued colorings of planar graphs	2018	Huimin Song Hong‐Jian Lai
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e19" altimg="si32.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-chromatic numbers of graphs with bounded sparsity parameters	2024	Sandip Das A. Lahiri Soumen Nandi Sagnik Sen S. Taruni
+	Graph<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1723" altimg="si509.svg"><mml:mi>r</mml:mi></mml:math>-hued colorings—A survey	2022	Ye Chen Suohai Fan Hong‐Jian Lai Murong Xu
+ PDF Chat	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1766" altimg="si161.svg"><mml:mi>r</mml:mi></mml:math>-hued <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1771" altimg="si16.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-coloring of planar graphs with girth at least 8 for <mml:math xmlns:mml="http://www.…	2020	Hoang La Mickaël Montassier Alexandre Pinlou Petru Valicov
+	On the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>b</mml:mi></mml:math>-coloring of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-tidy graphs	2010	Clara Inés Betancur Velasquez Flavia Bonomo Ivo Koch
+	On the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>b</mml:mi></mml:math>-chromatic number of regular bounded graphs	2015	El Sahili Amine Mekkia Kouider Mortada Maidoun
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>b</mml:mi></mml:math>-chromatic numbers of powers of paths and cycles	2013	Wu-Hsiung Lin Gerard J. Chang
+	Bounds for the chromatic number of some <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e37" altimg="si18.svg"><mml:mrow><mml:mi>p</mml:mi><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math>-free graphs	2023	Athmakoori Prashant S. Francis Raj M. Gokulnath
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:mn>1</mml:mn></mml:math>-improper <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:mn>2</mml:mn></mml:math>-coloring of sparse graphs	2013	O.V. Borodin Alexandr Kostochka Matthew Yancey
+	Planar graphs with girth at least 5 are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e139" altimg="si25.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-colorable	2019	Ilkyoo Choi Gexin Yu Xia Zhang
+ PDF Chat	Maximizing the number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml9" display="inline" overflow="scroll" altimg="si9.gif"><mml:mi>x</mml:mi></mml:math>-colorings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml10" display="inline" overflow="scroll" altimg="si10.gif"><mml:mn>4</mml:mn></mml:math>-chromatic graphs	2017	Aysel Erey

Works That Cite This (6)

Action	Title	Year	Authors
+	$$[r,s,t]$$ [ r , s , t ] -Colorings of Friendship Graphs and Wheels	2015	Wei Zhi Liao Mingchu Li
+	On (d,1)-total numbers of graphs	2008	Ko‐Wei Lih Daphne Der‐Fen Liu Weifan Wang
+	$$[1,1,t]$$ -Colorings of Complete Graphs	2012	Arnfried Kemnitz Massimiliano Marangio Źsolt Tuza
+	[r, s, t] - Colouring of Join Graphs S n + O m	2012	Mingzhong Mo
+	Generalized total colorings of graphs	2011	Mieczysław Borowiecki Arnfried Kemnitz Massimiliano Marangio Peter Mihók
+	[r, s, t]-Colorings of Graph Products	2013	Lyes Dekar Brice Effantin Hamamache Kheddouci

Works Cited by This (3)

Action	Title	Year	Authors
+ PDF Chat	A survey of hereditary properties of graphs	1997	Mieczysław Borowiecki Izak Broere Marietjie Frick Peter Mihók Gabriel Semanišin
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" overflow="scroll"><mml:mo stretchy="false">[</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:math>-Colorings of graphs	2006	Arnfried Kemnitz Massimiliano Marangio
+	The total chromatic number of graphs having large maximum degree	1993	A. J. W. Hilton H.R. Hind