Skip to main content

1 Result(s)

within Minýong Shi Remove this filter

and

  1. No Access

    Article

    (3,k)-Factor-Critical Graphs and Toughness

     A graph is (r,k)-factor-critical if the removal of any set of k vertices results in a graph with an r-factor (i.e. an r-regular spanning subgraph). Let t(G) denote the toughness of graph G. In this paper, we sho...

    Minýong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron in Graphs and Combinatorics (1999)