Interchangeability of relevant cycles in graphs.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Leydold, Josef, Stadler, Peter F. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mohammed M.M. Jaradat (2006)
Discussiones Mathematicae Graph Theory
Similarity:
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presented. Moreover, the basis numbers for the wreath product of the same classes are determined.
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
Petra M. Gleiss, Josef Leydold, Peter F. Stadler (2003)
Discussiones Mathematicae Graph Theory
Similarity:
The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined.
Vu Dinh Hoa (1998)
Discussiones Mathematicae Graph Theory
Similarity:
Vismara, Philippe (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Halina Bielak (2009)
Discussiones Mathematicae Graph Theory
Similarity:
We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, generalizing a results of Faudree and Schelp [4], and Dzido, Kubale and Piwakowski [2,3].
Terry A. McKee (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C⁺ is also formed from edges and one chord of a cycle C' of length one greater than C with V(C') ⊆ V(C⁺). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivalently, every chord of a cycle of length five or more has a noncrossing chord.
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.
Hoffman, F., Locke, S.C., Meyerowitz, A.D. (1991)
Mathematica Pannonica
Similarity:
Hong Wang (2012)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.
J. Węgrzyn (1971)
Applicationes Mathematicae
Similarity: