Bridge and cycle degrees of vertices of graphs.

Chartrand, Gary; Saba, Farrokh; Wormald, Nicholas C.

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

The search session has expired. Please query the service again.

Displaying similar documents to “Bridge and cycle degrees of vertices of graphs.”

A note on graph colouring

Dănuţ Marcu (1995)

Czechoslovak Mathematical Journal

Similarity:

A note on two circumference generalizations of Chvátal's Hamiltonicity condition

Ladislav Stacho (2002)

Mathematica Slovaca

Similarity:

Independence number and disjoint theta graphs.

Fujita, Shinya, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Turàn number of the graph 3P4

Halina Bielak, Sebastian Kieliszek (2014)

Annales UMCS, Mathematica

Similarity:

Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)

A note on the edge-connectivity of cages.

Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On eulerian subgraphs of complementary graphs

Ladislav Nebeský (1979)

Czechoslovak Mathematical Journal

Similarity: