Six-cycle systems

DOI10.1515/ms-2021-0003zbMath1482.05275OpenAlexW3173236514MaRDI QIDQ2054649

Mariusz Meszka, Alexander Rosa

Publication date: 3 December 2021

Published in: Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/ms-2021-0003

zbMATH Keywords

graph decompositionssix-cycle systems

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Lambda-fold 2-perfect 6-cycle systems in equipartite graphs
• Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems
• On the existence of cycle frames and almost resolvable cycle systems
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
• Equipartite gregarious 6- and 8-cycle systems
• Almost 2-perfect 6-cycle systems
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• The spectrum for 2-perfect 6-cycle systems
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The spectrum for lambda-fold 2-perfect 6-cycle systems
• Another class of balanced graph designs: Balanced circuit designs
• Decomposition of the complete directed graph into k-circuits
• On the groups of automorphisms of Steiner triple and quadruple systems
• Packing pentagons into complete graphs: How clumsy can you get?
• Embedding partial bipartite directed cycle systems
• Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Il primo amore non si scorda mai or an up-to-date survey of small embeddings for partial even-cycle systems
• Disjoint blocking sets in cycle systems
• A solution to the forest leave problem for partial 6-cycle systems
• Existence of cyclic \(k\)-cycle systems of the complete graph
• The equipartite Oberwolfach problem with uniform tables
• Cycle systems in the complete bipartite graph minus a one-factor
• Existence of 1-rotational \(k\)-cycle systems of the complete graph
• Partitionable perfect cycle systems with cycle lengths 6 and 8
• On cycle systems with specified weak chromatic number
• Decompositions of complete multipartite graphs into cycles of even length
• Squashing minimum coverings of 6-cycles into minimum coverings of triples
• Colouring even cycle systems
• Lambda-fold theta graphs: metamorphosis into 6-cycles
• Embeddings of Steiner triple systems
• Squashing maximum packings of 6-cycles into maximum packings of triples
• Maximum packings of the complete graph with uniform length cycles
• Decomposing complete equipartite graphs into cycles of length2p
• Cycle Systems in the Complete Bipartite Graph Plus a One-Factor
• Almost resolvable cycle systems-an analogue of Hanani triple systems
• DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES
• Small embeddings of partial directed cycle systems
• The intersection problem for m‐cycle systems
• The complete spectrum of 6‐cycle systems of l(k_n)
• Resolvable even‐cycle systems with a 1‐rotational automorphism
• Cyclic $m$-cycle systems of complete graphs minus a 1-factor
• Block colourings of 6-cycle systems
• Even‐cycle systems with prescribed automorphism groups
• From Squashed 6‐Cycles to Steiner Triple Systems
• A NOTE ON DECOMPOSITION OF COMPLETE EQUIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES
• Irreducible 2‐fold cycle systems
• Non-isomorphic 2-perfect 6-cycle systems of order 13
• Cycle Decompositions of $K_{\lowercase{n,n}}-I$
• The \(\mu\)-way intersection problem for \(m\)-cycle systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Six-cycle systems