𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cores of class II graphs

✍ Scribed by D. G. Hoffman

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
230 KB
Volume
20
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Maximum Ξ”-edge-colorable subgraphs of cl
Maximum Ξ”-edge-colorable subgraphs of class II graphs
✍ Vahan V. Mkrtchyan; Eckhard Steffen πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 180 KB

## Abstract A graph __G__ is class II, if its chromatic index is at least Ξ” + 1. Let __H__ be a maximum Δ‐edge‐colorable subgraph of __G__. The paper proves best possible lower bounds for |__E__(__H__)|/|__E__(__G__)|, and structural properties of maximum Δ‐edge‐colorable subgraphs. It is shown tha

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

Skeletal graphs β€” a new class of perfect
Skeletal graphs β€” a new class of perfect graphs
✍ A. Hertz πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 431 KB

Let S be an arbitrary collection of stars in a graph G such that there is no chain of length ~3 joining the centers of (any) two stars in G. We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S. These graphs will be called skeletal graphs and we pro

The core of a graph
The core of a graph
✍ Pavol Hell; Jaroslav NeΕ‘etΕ™il πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 924 KB
Class-reconstruction of total graphs
Class-reconstruction of total graphs
✍ David W. Bange; Anthony E. Barkauskas; Linda H. Host πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 533 KB

It is shown that given any vertex-deleted total graph, every reconstruction into a total graph by the addition of a vertex yields the original total graph. The proof indicates how the reconstruction can be done. Hu, for i = 1 , . . . , p , then G Definition. Let C be a class of graphs. A graph G E C