On the basis of the direct product of paths and wheels.
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.
Alexeev, Boris (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is the usual notation for the complete multigraph on n vertices and in which every edge is taken λ times. In this paper, we investigate necessary and sufficient conditions for the existence of the decomposition of λKn into edges disjoint of stars Sk’s and cycles Ck’s.
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
Leydold, Josef, Stadler, Peter F. (1998)
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: