Ear decompositions in combed graphs.

de Carvalho, Marcelo H.; Little, C.H.C.

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

Displaying similar documents to “Ear decompositions in combed graphs.”

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

On a problem of P. Vestergaard concerning circuits in graphs

Bohdan Zelinka (1987)

Czechoslovak Mathematical Journal

Similarity:

Intersection Graphs of Graphs

Bohdan Zelinka (1975)

Matematický časopis

Similarity:

Eulerian polar graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Similarity:

The excessive [3]-index of all graphs.

Cariolaro, David, Fu, Hung-Lin (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity: