✦ LIBER ✦

Definitions of criticality with respect to edge-coloring

✍ Scribed by A. J. W. Helton

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 310 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010112

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Here we examine six definitions of criticality concerning the chromatic index (edge chromatic number) of a simple graph. Five of these turn out to be almost always almost equivalent. Some problems arise and some conjectures are posed.

📜 SIMILAR VOLUMES

Color critical hypergraphs with many edg

Color critical hypergraphs with many edges

✍ V. Rödl; M. Siggers 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

On the Number of Edges in Hypergraphs Cr

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr

Monochromatic Trees with Respect to Edge

Monochromatic Trees with Respect to Edge Partitions

✍ V. Rodl; B. Voigt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 270 KB

It is shown. that for every infinite cardinal \(\kappa\) there exists a graph \(F\) on \(\kappa\) vertices satisfying \(F \rightarrow(T)_{i}^{\text {edgen }}\) for every tree \(T\) on \(\kappa\) vertices and all \(i\) satisfying cf \(\kappa \rightarrow((1))_{j}^{3}\). ' 1993 Acadenic Press, Inc.

Acyclic edge coloring of graphs with max

Acyclic edge coloring of graphs with maximum degree 4

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). It was conj

Edge-face coloring of plane graphs with

Edge-face coloring of plane graphs with maximum degree nine

✍ Jean-Sébastien Sereni; Matěj Stehlík 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3): [21][22][23][24][25][26][27][28][29][30][31][32][33] 1994] proved that every plane graph of max

Threshold functions for asymmetric Ramse

Threshold functions for asymmetric Ramsey properties with respect to vertex colorings

✍ Bernd Kreuter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

In this note we investigate Ramsey properties of random graphs. The threshold functions for symmetric Ramsey properties with respect to vertex colorings were determined by tuczak, Rucinski, and Voigt . As a generalization of this problem we consider asymmetric Ramsey properties and establish the val