### Graphs of semigroups

Bohdan Zelinka (1981)

Časopis pro pěstování matematiky

Similarity:

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

Bohdan Zelinka (1981)

Časopis pro pěstování matematiky

Similarity:

Nikiforov, Vladimir (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Nelson, Donald, Plummer, Michael D., Robertson, Neil, Zha, Xiaoya (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Tomoki Yamashita (2007)

Discussiones Mathematicae Graph Theory

Similarity:

A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fan [4] showed that if G is a 2-connected graph with δ(G) ≥ 1/3(|V(G)| - 4), then G has a vertex-dominating cycle. In this paper, we prove that if G is a 2-connected bipartite graph with partite sets V₁ and V₂ such that δ(G) ≥ 1/3(max{|V₁|,|V₂|} + 1), then G has a vertex-dominating cycle.

Binlong Lia, Shenggui Zhang (2016)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a graph on n vertices. A vertex of G with degree at least n/2 is called a heavy vertex, and a cycle of G which contains all the heavy vertices of G is called a heavy cycle. In this note, we characterize graphs which contain no heavy cycles. For a given graph H, we say that G is H-heavy if every induced subgraph of G isomorphic to H contains two nonadjacent vertices with degree sum at least n. We find all the connected graphs S such that a 2-connected graph G being S-heavy implies...

Pavol Híc (1986)

Mathematica Slovaca

Similarity:

Stacho, L. (1995)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Vasil Jacoš (1975)

Matematický časopis

Similarity:

Peled, Uri N., Wu, Julin (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity: