𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The core of a graph

✍ Scribed by Pavol Hell; Jaroslav Nešetřil

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
924 KB
Volume
109
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A gap between the appearances of a k-cor
A gap between the appearances of a k-core and a (k + 1)-chromatic graph
✍ Michael Molloy 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

We observe that the values of p for which with high probability Gm,p is k-colorable and for which with high probability G,,p has no k-core are not equal for k 2 4.

Cores of class II graphs
Cores of class II graphs
✍ D. G. Hoffman 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB

## Abstract We find necessary and sufficient conditions for a graph __G__ to be the core of a graph containing an overfull subgraph of the same maximum degree. Thus we enlarge the list of graphs known to be cores of class II graphs. © 1995 John Wiley & Sons, Inc.

Cores and Compactness of Infinite Direct
Cores and Compactness of Infinite Directed Graphs
✍ Bruce L. Bauslaugh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 665 KB

In this paper we define the property of homomorphic compactness for digraphs. We prove that if a digraph H is homomorphically compact then H has a core, although the converse does not hold. We also examine a weakened compactness condition and show that when this condition is assumed, compactness is

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap