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.
Displaying similar documents to “Minimal cycle bases of outerplanar graphs.”
On the basis of the direct product of paths and wheels.
Interchangeability of relevant cycles in graphs.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge cycle extendable graphs
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.
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
On some problem related to fundamental cycle sets of a graph: Research notes
Maciej Sysło (1982)
Banach Center Publications
Similarity:
On a minimum cycle basis of a graph
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
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.
On bicritical snarks
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
A Note on a Broken-Cycle Theorem for Hypergraphs
Martin Trinks (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there