Every Orientation of a $4$-Chromatic Graph has a Non-Bipartite Acyclic Subgraph.
Asaf ShapiraPublished in: Electron. J. Comb. (2022)
Keyphrases
- bipartite graph
- graph model
- maximum matching
- graph databases
- graph mining
- np hard
- graph properties
- maximum weight
- edge weights
- graph data
- graph partitioning
- graph representation
- graph classification
- labeled graphs
- subgraph isomorphism
- undirected graph
- graph structure
- frequent subgraph mining
- real valued
- weighted graph
- graph theory
- dense subgraphs
- structured data
- query graph
- connected components
- color images
- maximum clique
- graph search
- stable set
- connected subgraphs
- connected graphs
- minimum weight
- graph matching
- bounded treewidth
- frequent subgraphs
- equivalence classes
- similarity graph
- graph theoretic
- position and orientation
- human perception
- subgraph mining
- subgraph matching
- directed graph
- special case