Automorphism groups of graphs with 1-factorizations
From MaRDI portal
DOI10.1016/0012-365X(95)00065-5zbMATH Open0859.05050WikidataQ114215605 ScholiaQ114215605MaRDI QIDQ1815305FDOQ1815305
Authors: Ulrike Baumann
Publication date: 7 April 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Lovász' lattice reduction and the nearest lattice point problem
- Graphs of Degree Three with a Given Abstract Group
- Title not available (Why is that?)
- Symmetry Groups of Coloured Graphs
- Automorphism groups of pictures
- Title not available (Why is that?)
Cited In (6)
- On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
- A note on automorphisms of coset digraphs
- One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s
- Title not available (Why is that?)
- Restricted coloring problems on graphs with few \(P_4\)'s
This page was built for publication: Automorphism groups of graphs with 1-factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815305)