The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges.
Alexandr V. KostochkaBenjamin ReinigerPublished in: Eur. J. Comb. (2015)
Keyphrases
- undirected graph
- edge weights
- spanning tree
- directed graph
- weighted graph
- vertex set
- bipartite graph
- nodes of a graph
- directed edges
- directed acyclic graph
- random graphs
- random walk
- minimum cost
- edge information
- graph model
- approximation algorithms
- edge detector
- connected components
- small number
- maximum number
- graph partitioning
- graph theory
- spectral embedding