Planar graphs without chordal 5-cycles are 2-good

Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang

Type: Article

Publication Date: 2018-01-29

Citations: 3

DOI: https://doi.org/10.1007/s10878-017-0243-9

View Publication

Locations

Journal of Combinatorial Optimization - View

Similar Works

Action	Title	Year	Authors
+	Planar graphs without 4- and 6-cycles are (7 : 2)-colorable	2020	Haitao Wu Yaojun Chen Xiaolan Hu
+ PDF Chat	Defective 2-colorings of planar graphs without 4-cycles and 5-cycles	2018	Pongpat Sittitrai Kittikorn Nakprasit
+ PDF Chat	Chords of 2-Factors in Planar Cubic Bridgeless Graphs	2022	Ajit A. Diwan
+ PDF Chat	Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable	2018	Heather Hoskins Runrun Liu Jennifer Vandenbussche Gexin Yu
+	Graphs having circuits with at least two chords	1982	Heinz‐Jürgen Voss
+	Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable	2023	Xiangwen Li Liu Jie Jian-Bo Lv
+	All 2-regular graphs consisting of 4-cycles are graceful	1994	Jaromír Abrham Anton Kotzig
+	Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ -colorable	2013	Lingji Xu Zhengke Miao Yingqian Wang
+	Variable Degeneracy of Planar Graphs without Chorded 6-Cycles	2024	Hui Fang Dan Huang Tao Wang Wei Fan Wang
+	Planar graphs are 9/2-colorable	2018	Daniel W. Cranston Landon Rabern
+	Planar 4-critical graphs with exactly 4 triangles	2013	Alexandr Kostochka
+	Graphs with a 3-Cycle-2-Cover	2015	Zhi‐Hong Chen Miaomiao Han Hong‐Jian Lai Mingquan Zhan
+	2-Distance coloring of planar graphs with girth 5	2017	Wei Dong Baogang Xu
+	Small cycles and 2-factor passing through any given vertices in graphs	2009	Jiuying Dong
+	The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles	2023	Yuhao Liu Mingyu Xiao
+	Graphs of diameter two with no 4-circuits	1999	J. A. Bondy Péter L. Erdős Siemion Fajtlowicz
+	Edge-disjoint Hamilton cycles in 4-regular planar graphs	1981	J. A. Bondy Roland Häggkvist
+	A vertex cover with chorded 4-cycles	2011	Yun Shu Gao Guo Jun Li Jin Yan
+	Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable	2016	Ying Bai Xiangwen Li Gexin Yu
+	The 2-surviving rate of planar graphs without 5-cycles	2015	Tingting Wu Jiangxu Kong Weifan Wang

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (13)

Action	Title	Year	Authors
+	The firefighter problem for graphs of maximum degree three	2006	Stephen Finbow Andrew D. King Gary MacGillivray Roméo Rizzi
+	The 2-surviving rate of planar graphs without 4-cycles	2012	Weifan Wang Jiangxu Kong Lianzhu Zhang
+	The surviving rate of planar graphs	2011	Jiangxu Kong Weifan Wang Xuding Zhu
+	The 2-surviving rate of planar graphs without 5-cycles	2015	Tingting Wu Jiangxu Kong Weifan Wang
+	The surviving rate of an infected network	2010	Weifan Wang Stephen Finbow Ping Wang
+	Radio k-chromatic number of cycles for large k	2017	Nathaniel Karst Joshua Langowitz Jessica Oehrlein Denise Sakai Troxell
+	On certain parameters of equitable coloring of graphs	2017	Sudev Naduvath N. Sudev K. Chithra S. Satheesh Johan Kok
+	On the minimum vertex covering transversal dominating sets in graphs and their classification	2017	R. Vasanthi K. G. Subramanian
+	The 2-surviving rate of planar graphs without 6-cycles	2013	Weifan Wang Stephen Finbow Jiangxu Kong
+	Planar graph is on fire	2015	Przemysław Gordinowicz