"The size of graphs with clique number m and without nowhere-zero 4-flows" by Zhi-Hong Chen

Article

The size of graphs with clique number m and without nowhere-zero 4-flows

Discrete Mathematics (1997)

Zhi-Hong Chen

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].

Keywords

Computer science,
Mathematics,
Graph theory

Disciplines

Computer Sciences and
Mathematics

Publication Date

January, 1997

DOI

https://doi.org/10.1016/0012-365X(95)00341-S

Publisher Statement

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.

Citation Information

Zhi-Hong Chen. "The size of graphs with clique number m and without nowhere-zero 4-flows" Discrete Mathematics Vol. 163 Iss. 1-3 (1997) p. 247 - 249 ISSN: 0012-365X
Available at: http://works.bepress.com/zhi_hong_chen/47/