#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2004

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- HongJian Lai, Lianying Miao, Yehong Shao, Liangxia Wan
- 2004

A graph G is triangularly connected if for every pair of edges e1, e2 ∈ E(G), G has a sequence of 3-cycles C1, C2, · · · , Cl such that e1 ∈ C1, e2 ∈ Cl and such that E(Ci) ∩ E(Ci+1) 6= ∅, (1 ≤ i ≤ l − 1). In this paper it is shown that every triangularly connected claw-free graph G with |E(G)| ≥ 3 is vertex pancyclic. This implies the former results in… (More)

- Liangxia Wan, Yanpei Liu
- J. Comb. Theory, Ser. B
- 2008

- Liangxia Wan, Yanpei Liu
- Ars Comb.
- 2006

- Liangxia Wan, Yanpei Liu
- Appl. Math. Lett.
- 2009

In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph. Given any connected graph, it is proved that its genus distribution is the sum of those for some cubic graphs by using the technique.

- Liangxia Wan, Yanpei Liu
- Ars Comb.
- 2010

- ‹
- 1
- ›