Degree conditions for the partition of a graph into cycles, edges and isolated vertices.
Shinya FujitaPublished in: Discret. Math. (2009)
Keyphrases
- vertex set
- weighted graph
- undirected graph
- random graphs
- edge weights
- directed edges
- directed graph
- spanning tree
- sufficient conditions
- maximum matching
- directed acyclic graph
- shortest path
- min cut
- adjacency matrix
- normalized cut
- graph theoretic
- bipartite graph
- graph structure
- data objects
- graph partitioning
- graph model
- complex networks
- stable set
- hamiltonian cycle
- multiscale
- graph clustering
- graph matching
- subgraph isomorphism
- phase transition
- adjacency graph
- densely connected