A note on the edge-connectivity of cages.

Wang, Ping; Xu, Baoguang; Wang, Jianfang

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A note on the edge-connectivity of cages.”

On the minimal length of the longest trail in a fixed edge-density graph

Vajk Szécsi (2013)

Open Mathematics

Similarity:

A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).

A note on graph colouring

Dănuţ Marcu (1995)

Czechoslovak Mathematical Journal

Similarity:

A simple proof of a theorem by Tutte.

Hetyei, Gábor (1999)

Mathematica Pannonica

Similarity:

$C_{4}$ -saturated graphs of minimum size

Zsolt Tuza (1989)

Acta Universitatis Carolinae. Mathematica et Physica

Similarity:

Transmission in graphs: A bound and vertex removing

Ľubomír Šoltés (1991)

Mathematica Slovaca

Similarity:

Displaying similar documents to “A note on the edge-connectivity of cages.”

On the minimal length of the longest trail in a fixed edge-density graph

A note on graph colouring

A simple proof of a theorem by Tutte.

C 4 -saturated graphs of minimum size

Transmission in graphs: A bound and vertex removing

$C_{4}$ -saturated graphs of minimum size