On spanning 2-trees in a graph

Authors:
Leizhen Cai
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
1997

Citing 0
Cited 4

The complexity of the locally connected spanning tree problem

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On the complexity of some subgraph problems

Discrete Applied Mathematics
The complexity of the locally connected spanning tree problem

Discrete Applied Mathematics
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract