An inequality involving the vertex arboricity and edge arboricity of a graph.
Stefan A. BurrPublished in: J. Graph Theory (1986)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- disjoint paths
- minimum weight
- graph structure
- strongly connected
- spanning tree
- bipartite graph
- random graphs
- connected components
- approximation algorithms
- directed acyclic graph
- graph theory
- labeled graphs
- hamiltonian cycle
- shortest path
- adjacency matrix
- average degree
- graph representation
- maximum cardinality
- attributed graphs
- graph model
- complex networks
- minimum spanning tree
- graph theoretic
- betweenness centrality
- edge detection
- image processing
- dependency graph
- graph partitioning
- graph databases
- graph matching
- random walk
- np hard