𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Edge-sets of Rigid and Corigid Graphs

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

Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
381 KB
Volume
87
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

📜 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 Size of Edge Chromatic Critical G
On the Size of Edge Chromatic Critical Graphs
✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 85 KB

In this paper, by applying the discharging method, we prove that if

On the Number of Edges of Quadrilateral-
On the Number of Edges of Quadrilateral-Free Graphs
✍ Zoltán Füredi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 247 KB

If a graph has q 2 +q+1 vertices (q>13), e edges and no 4-cycles then e 1 2 q(q+1) 2 . Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdo s from the 1930's. 1996 Academic Press, Inc. ## 1. Results Let f (n) denote the maximum n

On the hamiltonicity of line graphs of l
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

On the Vertex-Distinguishing Proper Edge
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs
✍ Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li; Mariusz Woźniak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 189 KB

We prove the conjecture of Burris and Schelp: a coloring of the edges of a graph of order n such that a vertex is not incident with two edges of the same color and any two vertices are incident with different sets of colors is possible using at most n+1 colors. 1999 Academic Press ## 1. Introducti