✦ LIBER ✦

Packing of graphs and permutations

✍ Scribed by Mariusz Woźniak

Book ID: 104444566
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 269 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80194-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing of graphs and permutations—a sur

Packing of graphs and permutations—a survey

✍ Mariusz Woźniak 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 434 KB

Self-clique graphs and matrix permutatio

Self-clique graphs and matrix permutations

✍ Adrian Bondy; Guillermo Durán; Min Chih Lin; Jayme L. Szwarcfiter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract The __clique graph__ of a graph is the intersection graph of its (maximal) cliques. A graph is __self‐clique__ when it is isomorphic with its clique graph, and is __clique‐Helly__ when its cliques satisfy the Helly property. We prove that a graph is clique‐Helly and self‐clique if and o

Graphs and finite permutation groups

✍ Charles C. Sims 📂 Article 📅 1967 🏛 Springer-Verlag 🌐 French ⚖ 624 KB

Packing and covering dense graphs

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

Polytopes, permutation shapes and bin pa

Polytopes, permutation shapes and bin packing

✍ Marguerite A. Eisenstein-Taylor 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 123 KB

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