On the maximum induced forests of a connected cubic graph without triangles.
Maolin ZhengXiaoyun LuPublished in: Discret. Math. (1990)
Keyphrases
- connected components
- neighborhood graph
- graph representation
- graph theory
- graph matching
- random walk
- massive graphs
- directed graph
- binary images
- bipartite graph
- directed acyclic graph
- weighted graph
- graph model
- stable set
- random forest
- graph structure
- graph mining
- graph databases
- undirected graph
- maximum number
- structured data
- adjacency matrix
- mobile robot