UB Paderborn / Katalog / Suche / in CDI

Hall's theorem and extending partial latinized rectangles

Journal of combinatorial theory. Series A, 2015-02, Vol.130, p.26-41

2015

Volltextzugriff (PDF)

Degree-bounded factorizations of bipartite multigraphs and of pseudographs

Discrete mathematics, 2010-01, Vol.310 (2), p.288-302

Hilton, A.J.W.

2010

Volltextzugriff (PDF)

A generalization of Talbot's theorem about King Arthur and his Knights of the Round Table

Journal of combinatorial theory. Series A, 2009-07, Vol.116 (5), p.1023-1033

2009

Volltextzugriff (PDF)

( r , r + 1 ) -factorizations of ( d , d + 1 ) -graphs

Discrete mathematics, 2008-03, Vol.308 (5), p.645-669

Hilton, A.J.W.

2008

Volltextzugriff (PDF)

Amalgamations of factorizations of complete equipartite graphs

Discrete mathematics, 2004-07, Vol.284 (1), p.157-175

2004

Volltextzugriff (PDF)

The k-fold list coloring of cycles with Hall's condition

AKCE international journal of graphs and combinatorics, 2008-12, Vol.5 (2), p.135-145

2008

Volltextzugriff (PDF)

Amalgamations of connected k-factorizations

Journal of combinatorial theory. Series B, 2003-07, Vol.88 (2), p.267-279

2003

Volltextzugriff (PDF)

A sufficient condition for equitable edge-colourings of simple graphs

Discrete mathematics, 1994-04, Vol.128 (1), p.179-201

1994

Volltextzugriff (PDF)

Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs

Discrete mathematics, 2001-10, Vol.241 (1), p.189-199

2001

Volltextzugriff (PDF)

Aspects of edge list-colourings

Discrete mathematics, 2001-03, Vol.231 (1), p.253-264

2001

Volltextzugriff (PDF)

Non-conformable subgraphs of non-conformable graphs

Discrete mathematics, 2002-09, Vol.256 (1), p.203-224

2002

Volltextzugriff (PDF)

The structure of totally critical graphs of odd order

Discrete mathematics, 2003-05, Vol.266 (1), p.229-238

2003

Volltextzugriff (PDF)

The Overfull Conjecture and the Conformability Conjecture

Discrete mathematics, 2001-10, Vol.241 (1), p.343-361

2001

Volltextzugriff (PDF)

The Hall number, the Hall index, and the total Hall number of a graph

Discrete Applied Mathematics, 1999-05, Vol.94 (1), p.227-245

1999

Volltextzugriff (PDF)

At most k-to-1 mappings between graphs, II

Discrete mathematics, 1996-06, Vol.154 (1), p.85-102

1996

Volltextzugriff (PDF)

The chromatic index of a graph whose core has maximum degree two

Discrete mathematics, 1992-05, Vol.101 (1), p.135-147

1992

Volltextzugriff (PDF)

Fractional latin squares, simplex algebras, and generalized quotients

Journal of statistical planning and inference, 2000-05, Vol.86 (2), p.457-504

2000

Volltextzugriff (PDF)

Vertex-splitting and chromatic index critical graphs

Discrete Applied Mathematics, 1997-06, Vol.76 (1), p.205-211

1997

Volltextzugriff (PDF)

A Vertex-Splitting Lemma, de Werra's Theorem, and Improper List Colourings

Journal of combinatorial theory. Series B, 1998-01, Vol.72 (1), p.91-103

1998

Volltextzugriff (PDF)

Extending Edge‐Colorings of Complete Graphs and Independent Edgesa

Annals of the New York Academy of Sciences, 1989-12, Vol.576 (1), p.30-41

1989

Volltextzugriff (PDF)

Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares

Discrete mathematics, 1997-04, Vol.167, p.17-34

1997

Volltextzugriff (PDF)

Totally Critical Even Order Graphs

Journal of combinatorial theory. Series B, 1999-07, Vol.76 (2), p.262-279

1999

Volltextzugriff (PDF)

The total chromatic number of graphs having large maximum degree

Discrete mathematics, 1993-07, Vol.117 (1), p.127-140

1993

Volltextzugriff (PDF)

Recent results on the total chromatic number

Discrete mathematics, 1993-02, Vol.111 (1-3), p.323-331

Hilton, A.J.W.

1993

Volltextzugriff (PDF)

Two conjectures on edge-colouring

Discrete mathematics, 1989, Vol.74 (1), p.61-64

Hilton, A.J.W.

1989

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Hall's theorem and extending partial latinized rectangles

Degree-bounded factorizations of bipartite multigraphs and of pseudographs

A generalization of Talbot's theorem about King Arthur and his Knights of the Round Table

( r , r + 1 ) -factorizations of ( d , d + 1 ) -graphs

Amalgamations of factorizations of complete equipartite graphs

The k-fold list coloring of cycles with Hall's condition

Amalgamations of connected k-factorizations

A sufficient condition for equitable edge-colourings of simple graphs

Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs

Aspects of edge list-colourings

Non-conformable subgraphs of non-conformable graphs

The structure of totally critical graphs of odd order

The Overfull Conjecture and the Conformability Conjecture

The Hall number, the Hall index, and the total Hall number of a graph

At most k-to-1 mappings between graphs, II

The chromatic index of a graph whose core has maximum degree two

Fractional latin squares, simplex algebras, and generalized quotients

Vertex-splitting and chromatic index critical graphs

A Vertex-Splitting Lemma, de Werra's Theorem, and Improper List Colourings

Extending Edge‐Colorings of Complete Graphs and Independent Edgesa

Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares

Totally Critical Even Order Graphs

The total chromatic number of graphs having large maximum degree

Recent results on the total chromatic number

Two conjectures on edge-colouring

Suchergebnisse filtern