𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5

✍ Scribed by Dalibor Froncek

Publisher
Springer Japan
Year
2007
Tongue
English
Weight
172 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Orthogonal double covers of general grap
Orthogonal double covers of general graphs
✍ Sven Hartmann; Ulrike Schumacher πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 344 KB

Let H be a graph on n vertices and G a collection of n subgraphs of H , one for each vertex. Then G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H . ODCs of complet

Orthogonal double covers of Kn,n by smal
Orthogonal double covers of Kn,n by small graphs
✍ Ramadan El-Shanawany; Hans-Dietrich O.F. Gronau; Martin GrΓΌttmΓΌller πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 443 KB

An orthogonal double cover (ODC) of Kn is a collection of graphs such that each edge of Kn occurs in exactly two of the graphs and two graphs have precisely one edge in common. ODCs of Kn and their generalizations have been extensively studied by several authors (e.g. in:

On the number of irreducible coverings b
On the number of irreducible coverings by edges of complete bipartite graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.