Results 261 to 270 of about 1,312,788 (294)
Some of the next articles are maybe not open access.
SIAM Journal on Discrete Mathematics, 1992
Let \(G\) be a bridgeless graph with \(n\) vertices and \(m\) edges and let \(r\) be the minimum length of an even cycle in \(G\) of length at least 6 \((r=\infty\) if there is no such cycle). It is proved that the edges of \(G\) can be covered by cycles whose total length is at most \(m+(n-1)r/(r- 1)\).
openaire +1 more source
Let \(G\) be a bridgeless graph with \(n\) vertices and \(m\) edges and let \(r\) be the minimum length of an even cycle in \(G\) of length at least 6 \((r=\infty\) if there is no such cycle). It is proved that the edges of \(G\) can be covered by cycles whose total length is at most \(m+(n-1)r/(r- 1)\).
openaire +1 more source
1978
A circuit cover is a set of circuits which cover all the edges of a graph; its length is the sum of the lengths of the circuits. In analyzing irrigation systems it is sometimes necessary to find a short circuit cover. It is shown that every bridge-free connected undirected graph with n vertices and e edges has a circuit cover the length of which is ...
Alon Itai, Michael Rodeh
openaire +2 more sources
A circuit cover is a set of circuits which cover all the edges of a graph; its length is the sum of the lengths of the circuits. In analyzing irrigation systems it is sometimes necessary to find a short circuit cover. It is shown that every bridge-free connected undirected graph with n vertices and e edges has a circuit cover the length of which is ...
Alon Itai, Michael Rodeh
openaire +2 more sources
1996
Within the framework of concurrent systems, several verification approaches require as a preliminary step the complete derivation of the state space. Partial-order methods are efficient for reducing the state explosion due to the representation of parallelism by interleaving.
François Vernadat 0001 +2 more
openaire +2 more sources
Within the framework of concurrent systems, several verification approaches require as a preliminary step the complete derivation of the state space. Partial-order methods are efficient for reducing the state explosion due to the representation of parallelism by interleaving.
François Vernadat 0001 +2 more
openaire +2 more sources
Computers & Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martine Labbé +2 more
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martine Labbé +2 more
openaire +4 more sources
Covering a Graph with Densest Subgraphs
La Matematica, 2022Finding cohesive subgraphs is fundamental in graph mining and graph theory. A number of models of cohesive subgraphs exist in the literature. Compared to other models, the densest subgraph has the advantage of being computed in polynomial time. The computational tractability and the natural definition of density have led to a prominent position in ...
Dondi, Riccardo, Popa, Alexandru
openaire +2 more sources
Bipartite Graphs and Coverings
2011In many real world applications, data are organized by coverings, instead of partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to applications.
Shiping Wang +2 more
openaire +1 more source
Canadian Journal of Mathematics, 1958
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core.
Dulmage, A. L., Mendelsohn, N. S.
openaire +1 more source
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core.
Dulmage, A. L., Mendelsohn, N. S.
openaire +1 more source
Journal of Graph Theory, 1995
AbstractLet k and n be two integers such that k ≥ 0 and n ≥ 3(k + 1). Let G be a graph of order n with minimum degree at least ⌈(n + k)/2⌉. Then G contains k + 1 independent cycles covering all the vertices of G such that k of them are triangles. © 1995, John Wiley & Sons, Inc.
openaire +1 more source
AbstractLet k and n be two integers such that k ≥ 0 and n ≥ 3(k + 1). Let G be a graph of order n with minimum degree at least ⌈(n + k)/2⌉. Then G contains k + 1 independent cycles covering all the vertices of G such that k of them are triangles. © 1995, John Wiley & Sons, Inc.
openaire +1 more source
Graphs with polynomial growth are covering graphs
Graphs and Combinatorics, 1992Let \(X(V,E)\) be a simple undirected locally finite graph with vertex set \(V(X)\) and edge set \(E(X)\). The growth function of \(X\), with respect to a vertex \(v\in V(X)\) is defined by \(f_ X(v,0)=1\) and \(f_ X(v,n)=|\{w\in V(X)| d(v,w)\leq n\}|\), \(n\in N\), where \(d(v,w)\) denotes the distance between \(v\) and \(w\).
Chris D. Godsil, Norbert Seifter
openaire +2 more sources
Coverings and homotopy of a graph
Discrete Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources