Live briefing
Everything about Covering graph
Graph related to another graph by a covering map
In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the vertex set of G. A covering map f is a surjection and a local isomorphism: the neighbourhood of a vertex v in C is mapped bijectively onto the neighbourhood of in G. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Covering graphA 5-minute orientation
- Skim a recent paper: Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and ExperimentsInfluential work since 2022
- Pick up a classic book: Organized CollapseThe most-reprinted book on the subject
- Read the landmark paper: Covering all cliques of a graphCited 104 times
- Go sideways: Bipartite double coverA closely related topic
- Go sideways: Cycle (graph theory)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Covering all cliques of a graph
Covering the cliques of a graph with vertices
Covering a graph by complete bipartite graphs
On covering all cliques of a chordal graph
An overview of graph covering and partitioning
Covering a Graph with Clubs
On Leighton’s graph covering theorem
Covering a graph with cycles
🆕 Influential since 2022
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments
Comparative Analysis of Logic Reasoning and Graph Neural Networks for Ontology-Mediated Query Answering With a Covering Axiom
On the Tractability of Covering a Graph with 2-Clubs
Dual hybrid frameworks combining graph convolutional network with decoding for covering location problem
Covering automorphisms and some eigenvalues of a graph
📚 Books worth reading
- 📕Organized CollapseDmitry N. Kozlov · 2020
- 📕Packing of graphsMariusz Woźniak · 1997
- 📕Discrete geometry and algebraic combinatoricsAlexander Barg, O. R. Musin · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Bipartite double cover In graph theory, the bipartite double cover of an undirected graph G is a bipartite, covering graph of G, with twice as many vertices as G. It can be constructe…
- Cycle (graph theory) In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a…
- Five color theorem The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the countries of the world,…
- Complete bipartite graph In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Planar graph In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect…
- Zarankiewicz problem Unsolved problem in mathematics What is the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete…
- Vertex-transitive graph In the mathematical field of graph theory, an automorphism is a permutation of the vertices such that edges are mapped to edges and non-edges are mapped…