Dalibor Froncek

P. Paananen

L. Sorensen

Discret. Math., 2024

2022

Regular handicap graphs of order n ≡ 4 (mod 8).

[BibT_eX]

[DOI]

Aaron Shepanik

Electron. J. Graph Theory Appl., 2022

On families of 2-nearly Platonic graphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2022

2021

Box-Object Redistribution Problem.

[BibT_eX]

[DOI]

Aaron Crenshaw

Fawwaz Fakhrurrozi Hadiputra

Am. Math. Mon., 2021

Chromatic number of super vertex local antimagic total labelings of graphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2021

A note on nearly Platonic graphs with connectivity one.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2021

Group distance magic and antimagic hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2021

Decompositions of complete graphs into connected unicyclic bipartite graphs with seven edges.

[BibT_eX]

[DOI]

Bull. ICA, 2021

2020

Group distance magic Cartesian product of two cycles.

[BibT_eX]

[DOI]

Pawel Dyrlaga

Discret. Math., 2020

Decomposition of complete graphs into bi-cyclic graphs with eight edges.

[BibT_eX]

[DOI]

Jehyun Lee

Bull. ICA, 2020

Note on diagonal construction of Z2nm-supermagic labeling of Cn□Cm.

[BibT_eX]

[DOI]

Michael McKeown

AKCE Int. J. Graphs Comb., 2020

2019

Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges.

[BibT_eX]

[DOI]

John Fahnenstiel

Electron. J. Graph Theory Appl., 2019

Orientable ℤn-distance magic graphs.

[BibT_eX]

[DOI]

Bryan J. Freyberg

Discuss. Math. Graph Theory, 2019

Balanced 3-nearly Platonic graphs.

[BibT_eX]

[DOI]

Jiangyi Qiu

Bull. ICA, 2019

Supermagic Graphs with Many Odd Degrees.

[BibT_eX]

[DOI]

Jiangyi Qiu

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

On regular handicap graphs of order $n \equiv 0$ mod 8.

[BibT_eX]

[DOI]

Aaron Shepanik

Electron. J. Graph Theory Appl., 2018

You can't always get what you want...

[BibT_eX]

[DOI]

Bull. ICA, 2018

Corrigendum to: A note on nearly platonic graphs.

[BibT_eX]

[DOI]

William J. Keith

Donald L. Kreher

Australas. J Comb., 2018

A note on nearly platonic graphs.

[BibT_eX]

[DOI]

William J. Keith

Donald L. Kreher

Australas. J Comb., 2018

2017

On regular handicap graphs of even order.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Preface.

[BibT_eX]

[DOI]

S. Arumugam

Electron. Notes Discret. Math., 2017

Decomposition of certain complete bipartite graphs into prisms.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Vertex magic total labelings of 2-regular graphs.

[BibT_eX]

[DOI]

Inne Singgih

Discret. Math., 2017

Magic rectangle sets of odd order.

[BibT_eX]

[DOI]

Australas. J Comb., 2017

2016

Distance magic Cartesian product of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Distance magic circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Alpha labelings of full hexagonal caterpillars.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2016

In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2016

2015

Group distance magic and antimagic graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

Edge reconstruction and the swapping number of a graph.

[BibT_eX]

[DOI]

Amy Hlavacek

Steven J. Rosenberg

Australas. J Comb., 2014

2013

Decomposition of complete bipartite graphs into generalized prisms.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Group distance magic labeling of Cartesian product of cycles.

[BibT_eX]

[DOI]

Australas. J Comb., 2013

2012

A note on 4-regular distance magic graphs.

[BibT_eX]

[DOI]

Tereza Kovárová

Australas. J Comb., 2012

2011

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2011

2010

Factorizations of complete graphs into caterpillars of diameter 5.

[BibT_eX]

[DOI]

Discret. Math., 2010

Decompositions of complete graphs into blown-up cycles Cm[2].

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Factorization of Kn, n into (0, j)-prisms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Oberwolfach rectangular table negotiation problem.

[BibT_eX]

[DOI]

Discret. Math., 2009

Note on Decomposition of Kn, n into (0, j)-prisms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Product rosy labeling of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2008

On biclique coverings.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Bi-cyclic decompositions of complete graphs into spanning trees.

[BibT_eX]

[DOI]

Discret. Math., 2007

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

2n-cyclic Blended Labeling of Graphs.

[BibT_eX]

Tereza Kovárová

Ars Comb., 2007

2006

Problem presented at the workshop in Krynica 2004.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

Orthogonal double covers of complete graphs by fat catepillars.

[BibT_eX]

[DOI]

Uwe Leck

Discuss. Math. Graph Theory, 2006

2005

Pancomponented 2-factorizations of complete graphs.

[BibT_eX]

[DOI]

Brett Stevens

Discret. Math., 2005

Vertex magic total labeling of products of cycles.

[BibT_eX]

[DOI]

Tereza Kovárová

Australas. J Comb., 2005

2004

Some remarks on domination.

[BibT_eX]

[DOI]

Dan Archdeacon

Joanna A. Ellis-Monaghan

J. Graph Theory, 2004

On traceability and 2-factors in claw-free graphs.

[BibT_eX]

[DOI]

Zdenek Ryjácek

Zdzislaw Skupien

Discuss. Math. Graph Theory, 2004

Cyclic decompositions of complete graphs into spanning trees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

2003

Preface.

[BibT_eX]

[DOI]

Charles J. Colbourn

Jeffrey H. Dinitz

Discret. Math., 2003

Regular clique covers of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

2002

Cyclic type factorizations of complete bipartite graphs into hypercubes.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

2001

On seed graphs with more than two components.

[BibT_eX]

[DOI]

Discret. Math., 2001

Self-complementary factors of almost complete tripartite graphs of even order.

[BibT_eX]

[DOI]

Discret. Math., 2001

Imbalance in tournament designs.

[BibT_eX]

[DOI]

Frantisek Franek

Alexander Rosa

Australas. J Comb., 2001

Cluttered Orderings for the Complete Graph.

[BibT_eX]

[DOI]

Myra B. Cohen

Charles J. Colbourn

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Halving Complete 4-Partite Graphs.

[BibT_eX]

Jozef Sirán

Ars Comb., 2000

1999

Note on cyclic decompositions of complete bipartite graphs into cubes.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1999

1998

2-halvable complete 4-partite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1998

1997

Almost self-complementary factors of complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters.

[BibT_eX]

[DOI]

Graphs Comb., 1996

The Existence of Selfcomplementary Circulant Graphs.

[BibT_eX]

[DOI]

Alexander Rosa

Jozef Sirán

Eur. J. Comb., 1996

Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters.

[BibT_eX]

[DOI]

Australas. J Comb., 1996

1994

e-Realization of double-stars.

[BibT_eX]

[DOI]