The size of graphs with clique number m and without nowhere-zero 4-flows
Document Type
Article
Publication Date
January 1997
Publication Title
Discrete Mathematics
First Page
247
Last Page
249
DOI
https://doi.org/10.1016/0012-365X(95)00341-S
Abstract
Let G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of|E(G)|⩾(n - 17 - k2)+(m - l)(k + 12)+ 33,where ⌊n−17/m⌋, then either G has a nowhere-zero 4-flow, or G can be contracted to the Petersen graph. This is a generalization of a result in [4].
Recommended Citation
Chen, Zhi-Hong, "The size of graphs with clique number m and without nowhere-zero 4-flows" Discrete Mathematics 163/1-3 (1997): 247-249.
Available at https://digitalcommons.butler.edu/facsch_papers/1196
Notes
Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the article or borrow it from a local library.