Skip to main content

2 Result(s)

within Naidan Ji Remove this filter

and

  1. No Access

    Article

    Graphs with Almost All Edges in Long Cycles

    For an edge e of a given graph G, define \(c_e(G)\) ...

    Naidan Ji, Meirun Chen in Graphs and Combinatorics (2018)

  2. No Access

    Article

    The Extremal Function for Two Disjoint Cycles

    A theta graph is the union of three internally disjoint paths that have the same two distinct end vertices. We show that every graph of order ...

    Yunshu Gao, Naidan Ji in Bulletin of the Malaysian Mathematical Sciences Society (2015)