A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number
暂无分享,去创建一个
[1] Dieter Rautenbach,et al. Uniquely restricted matchings in subcubic graphs , 2019, Discret. Appl. Math..
[2] R. Sarpong,et al. Bio-inspired synthesis of xishacorenes A, B, and C, and a new congener from fuscol† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c9sc02572c , 2019, Chemical science.
[3] Michael A. Henning,et al. Tight lower bounds on the matching number in a graph with given maximum degree , 2018, J. Graph Theory.
[4] Penny E. Haxell,et al. On Lower Bounds for the Matching Number of Subcubic Graphs , 2017, J. Graph Theory.
[5] Dieter Rautenbach,et al. Induced matchings in subcubic graphs without short cycles , 2014, Discret. Math..
[6] Dieter Rautenbach,et al. Independent sets and matchings in subcubic graphs , 2012, Discret. Math..
[7] Ermelinda DeLaViña,et al. On Total Domination in Graphs , 2012 .
[8] Douglas B. West,et al. Matching and edge-connectivity in regular graphs , 2011, Eur. J. Comb..
[9] Douglas B. West,et al. Balloons, cut‐edges, matchings, and total domination in regular graphs of odd degree , 2010, J. Graph Theory.
[10] Michael A. Henning,et al. Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph , 2007, Graphs Comb..
[11] Erik D. Demaine,et al. Tight bounds on maximal and maximum matchings , 2001, Discret. Math..