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...

used for the line graph include the covering graph, the derivative, the edge-to-vertex dual, the conjugate, the representative graph, and the θ-obrazom...

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...

to compute this covering graph efficiently; more generally, if B is any family of sets, they show how to compute the covering graph of the lattice of...

Look up covering in Wiktionary, the free dictionary. Covering may refer to: Window covering, material used to cover a window Cover (topology), a collection...

notion of a covering space. Bethe lattice is the universal cover of a Cayley graph Covering graph, a covering space for an undirected graph, and its special...

edge coverings in two graphs (the set C is marked with red). A minimum edge covering is an edge covering of smallest possible size. The edge covering number...

fundamental group of a connected covering space Y → X. The space Y is a (possibly infinite) topological graph, the Schreier coset graph having one vertex for each...

In graph theory, a quotient graph Q of a graph G is a graph whose vertices are blocks of a partition of the vertices of G and where block B is adjacent...

an abstract undirected graph, a covering graph of the complete graph on four vertices. H. S. M. Coxeter (1955) named this graph after Fritz Laves, who...

computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

from a variety of sources, covering places, people, businesses, and more. The information covered by Google's Knowledge Graph grew quickly after launch...

problem is polynomial for tree graphs but NP-hard for general graphs, the square covering problem is linear for hole-free polygons but NP-hard for general...

In graph theory, a planar cover of a finite graph G is a finite covering graph of G that is itself a planar graph. Every graph that can be embedded into...

cover can also be a set of cliques that cover all vertices of a graph. Sometimes "covering" is used in place of "cover". As well as being called the intersection...

Equivalently, a periodic Euclidean graph is a periodic realization of an abelian covering graph over a finite graph. A Euclidean graph is uniformly discrete if...

later as the double covering graphs of polar graphs by Zelinka (1976b), and still later as the double covering graphs of bidirected graphs by Zaslavsky (1991)...

abstract graph is the maximal abelian covering graph of the dipole graph D3, while the diamond crystal as an abstract graph is the maximal abelian covering graph...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

is a covering of minimal cost. There are various kinds of covering problems in graph theory, computational geometry and more; see Category:Covering problems...

In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph. In...

In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a...

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...

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

bipartite double cover of an undirected graph G, formed by the graph tensor product G × K2 A double covering group of a topological group such as a Lie...

category theory Homotopy lifting property, a unique path over a map Covering graph or lift Shoe lifts, a removable shoe insert Elevator shoes, shoes that...

can be represented as the covering graph of a bouquet. Beineke, Lowell W.; Wilson, Robin J. (2009), Topics in topological graph theory, Encyclopedia of...

skew-symmetric graph is the double covering graph of a bidirected graph. A bidirected graph may be regarded as an orientation of a signed graph, similarly...

of a Covering Graph problem (covering graphs is the terminology from topology; in the context of unique games these are often referred to as graph lifts)...

In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In...