Vol. 4 No. 1 (2011)

DOI: https://doi.org/10.26493/1855-3974.4_1

Published: 2010-08-23

Editorial

In memory of Michael O. Albertson, 1946–2009

Joan P. Hutchinson
- PDF

Articles

Disjoint homometric sets in graphs

Michael O. Albertson, Janos Pach, Michael E. Young

1-4
- PDF
- ABSTRACTS (EN/SI)
More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number

Michael O. Albertson, Debra L. Boutin, Ellen Gethner

5-24
- PDF
- ABSTRACTS (EN/SI)
Graphs with chromatic numbers strictly less than their colouring numbers

Xuding Zhu

25-27
- PDF
- ABSTRACTS (EN/SI)
How to lose as little as possible

Vittorio Addona, Stan Wagon, Herb Wilf

29-62
- PDF
- ABSTRACTS (EN/SI)
Motion and distinguishing number two

Marston D. E. Conder, Thomas W. Tucker

63-72
- PDF
- ABSTRACTS (EN/SI)
A new proof of 3-colorability of Eulerian triangulations

Mu-Tsun Tsai, Douglas B. West

73-77
- PDF
- ABSTRACTS (EN/SI)
On 2-factors with long cycles in cubic graphs

André Kündgen, R. Bruce Richter

79-93
- PDF
- ABSTRACTS (EN/SI)
The total weak discrepancy of a partially ordered set

Alan Shuchat, Randy Shull, Ann N. Trenk

95-109
- PDF
- ABSTRACTS (EN/SI)
Distinguishing partitions and asymmetric uniform hypergraphs

M. N. Ellingham, Justin Z. Schroeder

111-123
- PDF
- ABSTRACTS (EN/SI)
Gray code numbers for graphs

Kelly Choo, Gary MacGillivray

125-139
- PDF
- ABSTRACTS (EN/SI)
Natural realizations of sparsity matroids

Ileana Streinu, Louis Theran

141-151
- PDF
- ABSTRACTS (EN/SI)
Graphs with maximum degree 5 are acyclically 7-colorable

Alexandr V. Kostochka, Christopher J. Stocker

153-164
- PDF
- ABSTRACTS (EN/SI)
3-Connected planar graphs are 5-distinguishing colorable with two exceptions

Gašper Fijavž, Seiya Negami, Terukazu Sano

165-175
- PDF
- ABSTRACTS (EN/SI)
Dominating sets in triangulations on surfaces

Hong Liu, Michael J. Pelsmajer

177-204
- PDF
- ABSTRACTS (EN/SI)

Vol. 4 No. 1 (2011)

Editorial

In memory of Michael O. Albertson, 1946–2009

Articles

Disjoint homometric sets in graphs

More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number

Graphs with chromatic numbers strictly less than their colouring numbers

How to lose as little as possible

Motion and distinguishing number two

A new proof of 3-colorability of Eulerian triangulations

On 2-factors with long cycles in cubic graphs

The total weak discrepancy of a partially ordered set

Distinguishing partitions and asymmetric uniform hypergraphs

Gray code numbers for graphs

Natural realizations of sparsity matroids

Graphs with maximum degree 5 are acyclically 7-colorable

3-Connected planar graphs are 5-distinguishing colorable with two exceptions

Dominating sets in triangulations on surfaces

Developed By

Information