Graphs with No Induced Five-Vertex Path or Antipath.
Maria ChudnovskyLouis EsperetLaetitia LemoinePeter MaceliFrédéric MaffrayIrena PenevPublished in: J. Graph Theory (2017)
Keyphrases
- directed graph
- undirected graph
- edge weights
- labeled graphs
- attributed graphs
- hamiltonian cycle
- shortest path
- weighted graph
- graph matching
- strongly connected
- maximum cardinality
- graph theoretic
- vertex set
- finding the shortest path
- graph mining
- graph clustering
- connected subgraphs
- minimum cost
- graph theory
- adjacency matrix
- betweenness centrality
- graph representation
- series parallel
- random graphs
- data sets
- spanning tree
- endpoints
- graph structure
- approximation algorithms
- mobile robot
- pattern recognition