Filters

70 Hits in 2.5 sec

### Page 2310 of Mathematical Reviews Vol. , Issue 99d [page]

1991 Mathematical Reviews
The switching class [G] determined by G consists of all vertex switchings G4 for subsets A C V. We prove that the trees of a switching class [G] are isomorphic to each other.  ...  We also determine the types of trees T that have isomorphic copies in [G]. Finally we show that apart from one exceptional type of forest, the real forests in a switching class are isomorphic.  ...

### Vertex pancyclic graphs

Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
2002 Discrete Applied Mathematics
In this paper, we shall present di erent su cient conditions for graphs to be vertex pancyclic. ?  ...  A graph G is called pancyclic if it contains a cycle of length k for every 3 6 k 6 n, and it is called vertex pancyclic if every vertex is contained in a cycle of length k for every 3 6 k 6 n.  ...  We deÿne a very important family H ; n of graph classes which will be useful in the following to provide bounds for vertex pancyclicity and fully extendability. Remark 8.  ...

### Pancyclic properties of the graph of some 0–1 polyhedra

1984 Journal of combinatorial theory. Series B (Print)
In this paper it is shown that a certain class of (&l) polyhedra, which includes the matroid basis polytopes and the perfect matching polytopes, have graphs with the property that the edges, under a certain  ...  This class will be defined in the next section, where the basic concepts on polyhedra with O-l valued vertices are recalled.  ...  pancyclic and not pancyclic (except if p = 3, in which case they are pancyclic).  ...

### The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order

Brett Stevens
2002 Electronic Journal of Combinatorics
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of $K_{2n+1}$, not with consistent cycle components in each 2-factor  ...  like the Oberwolfach problem, but such that every admissible cycle size appears at least once in some 2-factor.  ...  In this definition, when n < 4, or n − 2 < 2, then the only admissible cycle size is n and the pancyclic 2-factorizations in these cases are trivial.  ...

### Page 1491 of Mathematical Reviews Vol. , Issue 2001C [page]

2001 Mathematical Reviews
in switching classes.  ...  We show that every switching class, except the class of all complete bipartite graphs, contains a pancyclic graph.  ...

### Page 3258 of Mathematical Reviews Vol. 58, Issue 5 [page]

1979 Mathematical Reviews
The vanishing of these in- variants has combinatorial significance. For example, y =0 if and only if there is a graph in the switching class which admits G as an automorphism group.  ...  Equivalent concepts are switching classes of graphs, double coverings of complete graphs, and depen- dent sets of equiangular lines in Euclidean space.  ...

### Contents

2004 Discrete Mathematics

### Graph classes characterized both by forbidden subgraphs and degree sequences

Michael D. Barrus, Mohit Kumbhat, Stephen G. Hartke
2007 Journal of Graph Theory
We say that F is a degree-sequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C.  ...   characterized all pairs of connected graphs {A, B} such that any 3-connected {A, B}-free graph is pancyclic.  ...  In this paper, we address the question of which classes of graphs can be characterized both in terms of a small collection of forbidden subgraphs, and in terms of their degree sequences.  ...
« Previous Showing results 1 — 15 out of 70 results