Homogeneous embeddings of cycles in graphs
If \(G\) and \(H\) are vertex-transitive graphs, then the framing number \(\text{fr}(G, H)\) of \(G\) and \(H\) is defined as the minimum order of a graph every vertex of which belongs to an induced \(G\) and an induced \(H\). This paper investigates \(\text{fr}(C_m, C_n)\) for \(m < n\). The authors show first that \(\text{fr}(C_m, C_n) \geq n + 2\) and determine when equality occurs. Thereafter they establish general lower and upper bounds which show that \(\text{fr}(C_m, C_n)\) is approximately the minimum of \(n - m + 2\sqrt{n}\) and \(n + \frac{n}{m}\).
- Frames of cycles and directed cycles
- Separating and nonseparating disjoint homotopic cycles in graph embeddings
- The cycle space of an embedded graph
- Homogeneously embedding stratified graphs in stratified graphs
- SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH
- scientific article; zbMATH DE number 1051293 (Why is no real title available?)
- On cliques and bicliques
- On cyclically embeddable graphs
- scientific article; zbMATH DE number 2170439 (Why is no real title available?)
- scientific article; zbMATH DE number 800288 (Why is no real title available?)
- scientific article; zbMATH DE number 812068 (Why is no real title available?)
This page was built for publication: Homogeneous embeddings of cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1299993)
