Graph Colouring and Variations

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): D. de Werra and A. Hertz (Eds.)
Series: Annals of Discrete Mathematics 39
Publisher: North Holland
Year: 1989

Language: English
Commentary: +OCR
Pages: ii-iv, 1-261

Content:
General Editor
Page ii

Edited by
Page iii

Copyright page
Page iv

Foreword
Pages 1-2
A. Hertz, D. de Werra

Minimax Relations for the Partial q- Colorings of a Graph Original Research Article
Pages 3-14
C. Berge

A Min-Max Relation for the Partial q-Colourings of a Graph. Part II: Box Perfection Original Research Article
Pages 15-27
Kathie Cameron

On Locally-Perfect Colorings Original Research Article
Pages 29-32
Pierre Duchet

The Subchromatic Number of a Graph Original Research Article
Pages 33-49
M.O. Albertson, R.E. Jamison, S.T. Hedetniemi, S.C. Locke

Connected Sequential Colorings Original Research Article
Pages 51-59
A. Hertz, D. De Werra

Two Conjectures on Edge-Colouring Original Research Article
Pages 61-64
A.J.W. Hilton

A New Upper Bound for the List Chromatic Number Original Research Article
Pages 65-75
B. Bollobás, H.R. Hind

Note on Perfect Orders Original Research Article
Pages 77-84
C.T. Ho`ng, N.V.R. Mahadev

On the Penrose Number of Cubic Diagrams Original Research Article
Pages 85-97
Françlois Jaeger

On the Edge Achromatic Numbers of Complete Graphs Original Research Article
Pages 99-115
Robert E. Jamison

Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs Original Research Article
Pages 117-124
H.A. Kierstead

Interval Vertex-Coloring of a Graph With Forbidden Colors Original Research Article
Pages 125-136
Marek Kubale

Hadwiger's Conjecture (k = 6): Neighbour Configurations of 6-Vertices in Contraction-Critical Graphs Original Research Article
Pages 137-148
Jean Mayer

About Colorings, Stability And Paths in Directed Graphs Original Research Article
Pages 149-150
Henry Meyniel

On the Harmonious Chromatic Number of a Graph Original Research Article
Pages 151-157
John Mitchem

Weak Bipolarizable Graphs Original Research Article
Pages 159-171
Stephan Olariu

P4-Comparability Graphs Original Research Article
Pages 173-200
C.T. Ho`ng, B.A. Reed

On Constructive Methods in the Theory of Colour-Critical Graphs: Dedicated To Dr. Tibor Gallai on the Occasion of his 75Th Birthday. Original Research Article
Pages 201-226
Horst Sachs, Michael Stiebitz

Chromatic Partitions of a Graph Original Research Article
Pages 227-239
E. Sampathkumar, C.V. Venkatachalam

Sequential Coloring Versus Welsh-Powell Bound Original Research Article
Pages 241-243
Maciej M. Sysło

A Generalization of Robacker's Theorem Original Research Article
Pages 245-252
S.K. Tipnis, L.E. Trotter Jr.

A Randomised 3-Colouring Algorithm Original Research Article
Pages 253-261
A.D. Petford, D.J.A. Welsh