Displaying similar documents to “Circuit bases of strongly connected digraphs”

Minimal cycle bases of the lexicographic product of graphs

M.M.M. Jaradat (2008)

Discussiones Mathematicae Graph Theory

Similarity:

A construction of minimum cycle bases of the lexicographic product of graphs is presented. Moreover, the length of a longest cycle of a minimal cycle basis is determined.

Strongly pancyclic and dual-pancyclic graphs

Terry A. McKee (2009)

Discussiones Mathematicae Graph Theory

Similarity:

Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C¯ and every nonspanning cycle C is almost contained in another cycle C⁺. This is equivalent to requiring, in addition, that the sizes of C¯ and C⁺ differ by one from the size of C. Strongly pancyclic graphs are pancyclic and chordal, and their cycles enjoy certain interpolation and extrapolation properties...

Cycle Double Covers of Infinite Planar Graphs

Mohammad Javaheri (2016)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.

Cycles in graphs and related problems

Antoni Marczyk

Similarity:

Our aim is to survey results in graph theory centered around four themes: hamiltonian graphs, pancyclic graphs, cycles through vertices and the cycle structure in a graph. We focus on problems related to the closure result of Bondy and Chvátal, which is a common generalization of two fundamental theorems due to Dirac and Ore. We also describe a number of proof techniques in this domain. Aside from the closure operation we give some applications of Ramsey theory in the research of cycle...

Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs

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