Vertex‐regular 1‐factorizations in infinite graphs
From MaRDI portal
Publication:6146192
DOI10.1002/jcd.21829zbMath1529.05120arXiv2106.09468OpenAlexW4210934157WikidataQ114236265 ScholiaQ114236265MaRDI QIDQ6146192
Publication date: 5 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09468
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- Unnamed Item
- Abelian 1-factorizations in infinite graphs
- Symmetric 1-factorizations of the complete graph
- Cyclic one-factorization of the complete graph
- Frattini-based starters in 2-groups
- Quaternionic starters
- One-factorizations of complete graphs with vertex-regular automorphism groups
- On a Class of Fixed-Point-Free Graphs
- Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
- Nilpotent 1-factorizations of the complete graph
- Abelian 1-factorizations of the complete graph
This page was built for publication: Vertex‐regular 1‐factorizations in infinite graphs