𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On some partial line graphs of a hypergraph and the associated matroid

✍ Scribed by Philippe Jégou; Marie-Catherine Vilarem

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
753 KB
Volume
111
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Jegou, P. and M.-C. Vilarem, On some partial line graphs of a hypergraph and the associated matroid, Discrete Mathematics 111 (1993) 3333344.

In this paper, we define for a hypergraph H =(X, G) a class of partial graphs of its line graph CR(H);

📜 SIMILAR VOLUMES

On the independence number of the Erdős-
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph
✍ Dhruv Mubayi; Jason Williford 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that

A note on the line-distinguishing chroma
A note on the line-distinguishing chromatic number and the chromatic index of a graph
✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

On the number of distinct minimal clique
On the number of distinct minimal clique partitions and clique covers of a line graph
✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab