The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces.
Ken-ichi KawarabayashiAtsuhiro NakamotoPublished in: Discret. Math. (2007)
Keyphrases
- spanning tree
- edge disjoint
- undirected graph
- minimum weight
- edge weights
- minimum spanning tree
- directed graph
- minimum cost
- maximum cardinality
- simulated annealing
- hamiltonian cycle
- labeled graphs
- total length
- attributed graphs
- three dimensional
- connected subgraphs
- graph theoretic
- genetic algorithm ga
- weighted graph
- free form
- random graphs
- average degree
- graph properties
- reeb graph
- bayesian networks
- data points
- surface registration
- bipartite graph
- surface reconstruction
- range data