Kevin N. Vander Meulen

According to our database, Kevin N. Vander Meulen authored at least 11 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Well-covered token graphs.

Fred M. Abdelmalek, Esther Vander Meulen, Kevin N. Vander Meulen, Adam Van Tuyl

Discuss. Math. Graph Theory, 2023

2018

Shedding vertices of vertex decomposable well-covered graphs.

Jonathan Baker, Kevin N. Vander Meulen, Adam Van Tuyl

Discret. Math., 2018

2017

Addressing graph products and distance-regular graphs.

Sebastian M. Cioaba, Randall J. Elzinga, Michelle Markiewitz, Kevin N. Vander Meulen, Trevor Vanderwoerd

Discret. Appl. Math., 2017

Shellability, vertex decomposability, and lexicographical products of graphs.

Kevin N. Vander Meulen, Adam Van Tuyl

Contributions Discret. Math., 2017

2016

Independence Complexes of Well-Covered Circulant Graphs.

Jonathan Earl, Kevin N. Vander Meulen, Adam Van Tuyl

Exp. Math., 2016

2008

Clique partitions of distance multigraphs.

Michael S. Cavers, Randall J. Elzinga, David A. Gregory, Sarah E. Vanderlinde, Kevin N. Vander Meulen

Discret. Math., 2008

2003

Inertia and biclique decompositions of joins of graphs.

David A. Gregory, Brenda Heyink, Kevin N. Vander Meulen

J. Comb. Theory, Ser. B, 2003

Decompositions of complete multigraphs derived from Hadamard matrices.

Katrina J. Geertsema, Kevin N. Vander Meulen

J. Comb. Theory, Ser. A, 2003

2002

Addressing the Petersen graph.

Randall J. Elzinga, David A. Gregory, Kevin N. Vander Meulen

Electron. Notes Discret. Math., 2002

1998

Decompositions of Complete Multigraphs Related to Hadamard Matrices.

David A. Gregory, Kevin N. Vander Meulen

J. Comb. Theory, Ser. A, 1998

1996

Sharp bounds for decompositions of graphs into complete <i>r</i>-partite subgraphs.

David A. Gregory, Kevin N. Vander Meulen

J. Graph Theory, 1996