Skip to search formSkip to main contentSkip to account menu

Covering graph

Known as: Covering 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
2011
2011
We examine various algebraic/combinatorial properties of Low-Density Parity-Check codes as predictors for the performance of the… 
2011
2011
The paper addresses a new class of combinatorial problems which consist in restructuring of solutions (as structures) in… 
2009
2009
This paper provides the definitions of co-basis and co-covering graph. Using these new notations, it deals with the relationship… 
2005
2005
Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in… 
1999
1999
We advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The… 
1999
1999
1991
1991
In this paper, we study composition and decomposition of Petri nets via a common set of places or transitions. We are interested… 
1985
1985
1984
1984
As is well known the covering graph ( = Hasse diagram) of any median semilattice is a median graph, and every median graph is the…