scientific article; zbMATH DE number 4061294
From MaRDI portal
Publication:3795706
Recommendations
Cited in
(28)- Covering vertices of a graph by \(k\) disjoint cycles
- Covering and tiling hypergraphs with tight cycles
- Resolvable coverings of 2-paths by cycles
- Cubic graphs that cannot be covered with four perfect matchings
- Fulkerson-covers of hypohamiltonian graphs
- On covers of graphs by Cayley graphs
- Projective, affine, and abelian colorings of cubic graphs
- The covering chain of a graph
- Wilson-Schreiber colourings of cubic graphs
- Coloring cubic graphs by point-intransitive Steiner triple systems
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
- scientific article; zbMATH DE number 4130423 (Why is no real title available?)
- scientific article; zbMATH DE number 5080500 (Why is no real title available?)
- Abelian Colourings of Cubic Graphs
- Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems
- Covering a graph with cycles passing through given edges
- Covering cycle matroid
- On DRC‐covering of Kn by cycles
- Covering a graph with cycles
- Degree Sums and Covering Cycles
- Cycles in Graphs and Covers
- Partial Degree Conditions and Cycle Coverings
- Computational complexity of covering cyclic graphs
- Covering the complete graph with plane cycles
- Cycle covers of cubic multigraphs
- The covering radius of the cycle code of a graph
- Treelike snarks
- Colouring cubic graphs by small Steiner triple systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795706)