No label defined (Q3142415)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 446493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 446493 |
Statements
28 June 1994
0 references
circuit cover
0 references
circuit decomposition
0 references
eulerian graph
0 references
0.7983620166778564
0 references
0.7983587980270386
0 references
0.7963283061981201
0 references
This paper is the most comprehensive and most updated survey article on the topics of faithful circuit cover, shortest circuit cover, compatible circuit decomposition and even circuit decomposition. The following are the definitions of those concepts. A family \({\mathcal F}_ 1\) of circuits of an integer-weighted graph \((G,w)\) is called a faithful circuit cover if each edge \(e\) of \(G\) is contained in precisely \(w(e)\) circuits of \({\mathcal F}_ 1\). A family of circuits of a graph \(G\) covering all edges of \(G\) and with the minimum total length is called a shortest circuit cover of \(G\). A forbidden system \({\mathcal P}\) of an eulerian graph \(G\) is a collection of some subsets of \(E(G)\). A circuit decomposition \({\mathcal F}_ 2\) of \(G\) is compatible to \({\mathcal P}\) if for each \(P \in {\mathcal P}\) and each \(C \in {\mathcal F}_ 2\), \(| P \cap E(C) | \leq 1\). A circuit decomposition \({\mathcal F}_ 3\) of an eulerian graph is even if each circuit of \({\mathcal F}_ 3\) is of even length. For the entire collection see [Zbl 0778.00039].
0 references