On some problem related to fundamental cycle sets of a graph: Research notes
Maciej Sysło (1982)
Banach Center Publications
Similarity:
Displaying similar documents to “Mathematical Models and a Constructive Heuristic for Finding Minimum Fundamental Cycle Bases”
On some problem related to fundamental cycle sets of a graph: Research notes
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Clustering cycles into cycles of clusters.
Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)
Journal of Graph Algorithms and Applications
Similarity:
The traveling salesman problem for cubic graphs.
Eppstein, David (2007)
Journal of Graph Algorithms and Applications
Similarity:
Minimal cycle bases of outerplanar graphs.
Leydold, Josef, Stadler, Peter F. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
Frieze, Alan (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
For which graphs does every edge belong to exactly two chordless cycles?
Peled, Uri N., Wu, Julin (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On bicritical snarks
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
On the basis of the direct product of paths and wheels.
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
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.