#### Filter Results:

#### Publication Year

2003

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Let denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graph G ∈ is said to be a forcing face of G if the subgraph of G obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal… (More)

- Zhibo Chen
- 2003

The idea of integral sum graphs was introduced by Harary (1994). A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u) + f(v) = f(w) for some node w in G. A tree is said to be a generalized star if it can be obtained… (More)

- ‹
- 1
- ›