Skip to main content

1 Result(s)

within Qiaofeng Zhao Remove this filter

and

  1. No Access

    Article

    On k- critical 2k- connected graphs

    A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ⊆ V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K2k+2?(1-factor) is the uniqu...

    Jianji Su, Xudong Yuan, Qiaofeng Zhao in Science in China Series A: Mathematics (2003)