Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Zheng, Maolin
and
Lu, Xiaoyun
1990.
On the maximum induced forests of a connected cubic graph without triangles.
Discrete Mathematics,
Vol. 85,
Issue. 1,
p.
89.
Liu, Jiping
and
Zhao, Cheng
1996.
A new bound on the feedback vertex sets in cubic graphs.
Discrete Mathematics,
Vol. 148,
Issue. 1-3,
p.
119.
Deming, Li
and
Yanpei, Liu
1999.
A tight lower bound on the maximum genus of 3-edge connected loopless graphs.
Acta Mathematicae Applicatae Sinica,
Vol. 15,
Issue. 4,
p.
361.
Deming, Li
and
Yanpei, Liu
1999.
The maximum genus of a 3-regular simplicial graph.
Applied Mathematics-A Journal of Chinese Universities,
Vol. 14,
Issue. 2,
p.
203.
Festa, Paola
Pardalos, Panos M.
and
Resende, Mauricio G. C.
1999.
Handbook of Combinatorial Optimization.
p.
209.
Festa, Paola
Via, Allende S.
Pardalos, Panos M.
and
Resende, Mauricio G. C.
2001.
Encyclopedia of Optimization.
p.
634.
Bau, Sheng
Wormald, Nicholas C.
and
Zhou, Sanming
2002.
Decycling numbers of random regular graphs.
Random Structures & Algorithms,
Vol. 21,
Issue. 3-4,
p.
397.
Vince, A.
2004.
The integrity of a cubic graph.
Discrete Applied Mathematics,
Vol. 140,
Issue. 1-3,
p.
223.
Pike, David A.
and
Zou, Yubo
2005.
Decycling Cartesian Products of Two Cycles.
SIAM Journal on Discrete Mathematics,
Vol. 19,
Issue. 3,
p.
651.
Rautenbach, Dieter
2007.
Dominating and large induced trees in regular graphs.
Discrete Mathematics,
Vol. 307,
Issue. 24,
p.
3177.
Festa, Paola
Pardalos, Panos M.
and
Resende, Mauricio G.C.
2008.
Encyclopedia of Optimization.
p.
1005.
Van Le, Dinh
and
Römer, Tim
2013.
Broken circuit complexes and hyperplane arrangements.
Journal of Algebraic Combinatorics,
Vol. 38,
Issue. 4,
p.
989.
Borowiecki, Mieczysław
Drgas-Burchardt, Ewa
and
Sidorowicz, Elżbieta
2014.
A feedback vertex set of 2-degenerate graphs.
Theoretical Computer Science,
Vol. 557,
Issue. ,
p.
50.
Gentner, Michael
and
Rautenbach, Dieter
2015.
Feedback vertex sets in cubic multigraphs.
Discrete Mathematics,
Vol. 338,
Issue. 12,
p.
2179.
Kelly, Tom
and
Liu, Chun‐Hung
2018.
Size of the largest induced forest in subcubic graphs of girth at least four and five.
Journal of Graph Theory,
Vol. 89,
Issue. 4,
p.
457.
Mynhardt, Christina M.
and
Wodlinger, Jane L.
2020.
The k-conversion number of regular graphs.
AKCE International Journal of Graphs and Combinatorics,
Vol. 17,
Issue. 3,
p.
955.
Kaul, Hemanshu
Mudrock, Jeffrey A.
and
Pelsmajer, Michael J.
2021.
Partial DP-coloring of graphs.
Discrete Mathematics,
Vol. 344,
Issue. 4,
p.
112306.
Gronemann, Martin
Nöllenburg, Martin
and
Villedieu, Anaïs
2023.
WALCOM: Algorithms and Computation.
Vol. 13973,
Issue. ,
p.
217.
Gunderson, Karen
Meagher, Karen
Morris, Joy
and
Pantangi, Venkata Raghu Tej
2023.
Induced forests in some distance-regular graphs.
Discrete Applied Mathematics,
Festa, Paola
Pardalos, Panos M.
and
C.Resende, Mauricio G.
2024.
Encyclopedia of Optimization.
p.
1.