UB Paderborn / Katalog / Suche / in CDI

Maximal sets of Hamilton cycles in K n r ; λ 1 , λ 2

Discrete mathematics, 2020-10, Vol.343 (10), p.112010, Article 112010

2020

Volltextzugriff (PDF)

Maximal sets of Hamilton cycles in Knr;λ1,λ2

Discrete mathematics, 2020-10, Vol.343 (10), Article 112010

2020

Volltextzugriff (PDF)

Total colorings of complete multipartite graphs using amalgamations

Discrete Applied Mathematics, 2024-12, Vol.359, p.186-195

2024

Volltextzugriff (PDF)

Maximal sets of Hamilton cycles in complete multipartite graphs IV

Discrete mathematics, 2022-08, Vol.345 (8), p.112932, Article 112932

2022

Volltextzugriff (PDF)

Fair and internally fair (holey) hamiltonian decompositions of K(n0,…,np−1;λ1,λ2)

Discrete mathematics, 2018-02, Vol.341 (2), p.315-323

2018

Volltextzugriff (PDF)

Equitable block-colorings of C4-decompositions of Kv−F

Discrete mathematics, 2016-05, Vol.339 (5), p.1519-1524

2016

Volltextzugriff (PDF)

Equitable block-colorings of C 4 -decompositions of K v − F

Discrete mathematics, 2016-05, Vol.339 (5), p.1519-1524

2016

Volltextzugriff (PDF)

More extreme equitable colorings of decompositions of Kv and Kv−F

Discrete mathematics, 2018-04, Vol.341 (4), p.1178-1184

2018

Volltextzugriff (PDF)

More extreme equitable colorings of decompositions of K v and K v − F

Discrete mathematics, 2018-04, Vol.341 (4), p.1178-1184

2018

Volltextzugriff (PDF)

Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs

Discrete mathematics, 2015-08, Vol.338 (8), p.1407-1415

2015

Volltextzugriff (PDF)

Group divisible designs with two associate classes, and quadratic leaves of triple systems

Discrete mathematics, 2013-10, Vol.313 (20), p.2104-2114

2013

Volltextzugriff (PDF)

Decomposition of the Kneser Graph into paths of length four

Discrete mathematics, 2015-08, Vol.338 (8), p.1284-1288

2015

Volltextzugriff (PDF)

Enclosings of λ-fold 5-cycle systems for u=2

Discrete mathematics, 2015-05, Vol.338 (5), p.743-765

2015

Volltextzugriff (PDF)

On the number of rainbow spanning trees in edge-colored complete graphs

Discrete mathematics, 2018-08, Vol.341 (8), p.2343-2352

2018

Volltextzugriff (PDF)

Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames

Discrete mathematics, 2015-07, Vol.338 (7), p.1173-1177

2015

Volltextzugriff (PDF)

On the embedding of partial three path designs

Discrete mathematics, 2016-05, Vol.339 (5), p.1476-1481

2016

Volltextzugriff (PDF)

Total-colorings of complete multipartite graphs using amalgamations

Discrete mathematics, 2016-05, Vol.339 (5), p.1587-1592

2016

Volltextzugriff (PDF)

Generalizing Clatworthy group divisible designs

Journal of statistical planning and inference, 2010-09, Vol.140 (9), p.2442-2447

2010

Volltextzugriff (PDF)

Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice

Discrete mathematics, 2012-11, Vol.312 (22), p.3328-3334

2012

Volltextzugriff (PDF)

Hamilton decompositions of graphs with primitive complements

Discrete mathematics, 2009-07, Vol.309 (14), p.4883-4888

2009

Volltextzugriff (PDF)

On Evenly-Equitable, Balanced Edge-Colorings and Related Notions

International journal of combinatorics, 2015-01, Vol.2015, p.1-7

2015

Volltextzugriff (PDF)

Hamilton decompositions of balanced complete multipartite graphs with primitive leaves

Discrete mathematics, 2010-07, Vol.310 (13), p.1965-1973

2010

Volltextzugriff (PDF)

Embedding Steiner triple systems in hexagon triple systems

Discrete mathematics, 2009-01, Vol.309 (2), p.487-490

2009

Volltextzugriff (PDF)

Maximal sets of hamilton cycles in K 2 p - F

Discrete mathematics, 2008-07, Vol.308 (13), p.2822-2829

2008

Volltextzugriff (PDF)

Resolvable 4-cycle group divisible designs with two associate classes: Part size even

Discrete mathematics, 2008-02, Vol.308 (2), p.303-307

2008

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Maximal sets of Hamilton cycles in K n r ; λ 1 , λ 2

Maximal sets of Hamilton cycles in Knr;λ1,λ2

Total colorings of complete multipartite graphs using amalgamations

Maximal sets of Hamilton cycles in complete multipartite graphs IV

Fair and internally fair (holey) hamiltonian decompositions of K(n0,…,np−1;λ1,λ2)

Equitable block-colorings of C4-decompositions of Kv−F

Equitable block-colorings of C 4 -decompositions of K v − F

More extreme equitable colorings of decompositions of Kv and Kv−F

More extreme equitable colorings of decompositions of K v and K v − F

Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs

Group divisible designs with two associate classes, and quadratic leaves of triple systems

Decomposition of the Kneser Graph into paths of length four

Enclosings of λ-fold 5-cycle systems for u=2

On the number of rainbow spanning trees in edge-colored complete graphs

Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames

On the embedding of partial three path designs

Total-colorings of complete multipartite graphs using amalgamations

Generalizing Clatworthy group divisible designs

Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice

Hamilton decompositions of graphs with primitive complements

On Evenly-Equitable, Balanced Edge-Colorings and Related Notions

Hamilton decompositions of balanced complete multipartite graphs with primitive leaves

Embedding Steiner triple systems in hexagon triple systems

Maximal sets of hamilton cycles in K 2 p - F

Resolvable 4-cycle group divisible designs with two associate classes: Part size even

Suchergebnisse filtern