Displaying similar documents to “Longest cycles in certain bipartite graphs.”

Graphs of semigroups

Časopis pro pěstování matematiky

Similarity:

Degree powers in graphs with a forbidden even cycle.

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On a conjecture concerning the Petersen graph.

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Vertex-dominating cycles in 2-connected bipartite graphs

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.

Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs

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

Criticality concepts in geodetic graphs

Mathematica Slovaca

Similarity:

A note on the circumference of graphs.

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

On $j$-Pancyclic Graphs

Matematický časopis

Similarity:

For which graphs does every edge belong to exactly two chordless cycles?

The Electronic Journal of Combinatorics [electronic only]

Similarity: