## Found 8 Documents (Results 1–8)

Full Text:

### Two strong 3-flow theorems for planar graphs. (English)Zbl 1495.05116

MSC:  05C21 05C10
Full Text:

### On the number of edges in some graphs. (English)Zbl 1442.05095

MSC:  05C30 05C38
Full Text:

### Almost all 5-regular graphs have a 3-flow. (English)Zbl 1495.05118

MSC:  05C21 05C80
Full Text:

### Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on $$k$$ vertices. (English)Zbl 1437.05051

MSC:  05C07 05C35
Full Text:

Full Text:

### A simple proof of Whitney’s theorem on connectivity in graphs. (English)Zbl 1224.05278

MSC:  05C40 05C38 05C45
Full Text:

### Notes on sufficient conditions for a graph to be hamiltonian. (English)Zbl 0764.05053

Reviewer: F. Tian (Beijing)
MSC:  05C45 05C20
Full Text:

all top 5