𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random packings of graphs

✍ Scribed by Lowell W. Beineke; Peter Hamburger; Wayne D. Goddard

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
612 KB
Volume
125
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-disjoint packings of graphs
Edge-disjoint packings of graphs
✍ Derek G. Corneil; Shigeru Masuyama; S. Louis Hakimi πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 941 KB
Random packing by ρ-connected ρ-regular
Random packing by ρ-connected ρ-regular graphs
✍ Lowell W. Beineke; Peter Hamburger; William D. Weakley πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 338 KB

A graph G is packable by the graph F if its edges can be partitioned into copies of F. If deleting the edges of any F-packable subgraph from G leaves an F-packable graph, then G is The minimal F-forbidden graphs provide a characterization of randomly F-packable graphs. We show that for each p-conne

Clique graphs of packed graphs
Clique graphs of packed graphs
✍ Iwao Sato πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 129 KB

Let IGI be the number of vertices of a graph G and to(G) be the density of G. We call a graph G packed if the clique graph K(G) of G has exactly 2 IGI-O'(G) cliques. We correct the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3]. All graphs considered here are f

Cycle packings in graphs and digraphs
Cycle packings in graphs and digraphs
✍ Jennifer J. Quinn πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 196 KB

A cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) elementary cycles. If D is a demiregular multidigraph we show that the arcs of D can be partitioned into Ai. cycle packings --where Ain is the maximum indegree of a vertex in D. We then show that the maximum len

Graph Packings
Graph Packings
✍ Pavol Hell πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 224 KB