𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of generalized good and equitable edge colorings

✍ Scribed by D. De Werra

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
620 KB
Volume
5
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Some classes of graphs are described which are extensions of bipartite multigraphs. Exclusion of some specific partial subgraphs gives some properties of edge colorability. in particular sufficient conditions are developed for the existence of generalized good and equitable colorings.

πŸ“œ SIMILAR VOLUMES

On the two-edge-colorings of perfect gra
On the two-edge-colorings of perfect graphs
✍ ChΓ­nh T. HoΓ ng πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 409 KB πŸ‘ 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. Β© 1995 Joh

On the number of colorings of a snark mi
On the number of colorings of a snark minus an edge
✍ Richard C. Bradley πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 93 KB

For a given snark G and a given edge e of G, let (G; e) denote the nonnegative integer such that for a cubic graph conformal to G Γ€ feg, the number of Tait colorings with three given colors is 18 Á (G; e). If two snarks G 1 and G 2 are combined in certain well-known simple ways to form a snark G, th

On the use of alternating chains and hyp
On the use of alternating chains and hypergraphs in edge coloring
✍ D. de Werra πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 320 KB

## Abstract Existence of some generalized edge colorings is proved by using the properties of hypergraphs as well as alternating chain methods. A general framework is given for edge colorings and some general properties of balancing are derived.

NP-completeness of list coloring and pre
NP-completeness of list coloring and precoloring extension on the edges of planar graphs
✍ DΓ‘niel Marx πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 110 KB

## Abstract In the edge precoloring extension problem, we are given a graph with some of the edges having preassigned colors and it has to be decided whether this coloring can be extended to a proper __k__‐edge‐coloring of the graph. In list edge coloring every edge has a list of admissible colors,

On the Existence and Uniqueness of Groun
On the Existence and Uniqueness of Ground States of a Generalized Spin-Boson Model
✍ Asao Arai; Masao Hirokawa πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 607 KB

A generalization of the standard spin-boson model is considered. The Hamiltonian H(:) of the model with a coupling parameter : # R acts in the tensor product H F b of a Hilbert space H and the boson (symmetric) Fock space F b over L 2 (R & ). The existence and uniqueness of ground states of H(:) are