Domination parameters of graph covers
From MaRDI portal
Cites work
- Another approach to planar cover conjecture focusing on rotation systems
- Covering all cliques of a graph
- Critical concepts in domination
- Domination in Graphs: Core Concepts
- Domination number of graphs with minimum degree five
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- scientific article; zbMATH DE number 2204183 (Why is no real title available?)
- Independence in 5-uniform hypergraphs
- On the domination number of cross products of graphs
- On the parity of planar covers
- Paths, Stars and the Number Three
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Random graph coverings. I: General theory and graph connectivity
- Random lifts of graphs
- Small transversals in hypergraphs
- Some remarks on domination
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The spherical genus and virtually planar graphs
- Topics in Domination in Graphs
- Topological graph theory.
- Total domination in graphs
- Vertex domination-critical graphs
This page was built for publication: Domination parameters of graph covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445859)