William L. Kocay

Orcid: 0000-0002-6689-4911

Affiliations:
  • University of Manitoba, Department of Computer Science, Winnipeg, MB, Canada


According to our database1, William L. Kocay authored at least 35 papers between 1982 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs.
Algorithmica, March, 2023

2022
Embedding K3, 3 and K5 on the Double Torus.
CoRR, 2022

2021
On null 3-hypergraphs.
Discret. Appl. Math., 2021

A Study on the Existence of Null Labelling for 3-Hypergraphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Properties of Unique Degree Sequences of 3-Uniform Hypergraphs.
Proceedings of the Discrete Geometry and Mathematical Morphology, 2021

2018
Coordinatizing <i>n</i><sub>3</sub> configurations.
Ars Math. Contemp., 2018

2017
Intersection Preserving Mappings.
Graphs Comb., 2017

2016
A Note on Non-reconstructible 3-Hypergraphs.
Graphs Comb., 2016

One-point extensions in n_3 configurations.
Ars Math. Contemp., 2016

2015
On k-edge-magic labelings of maximal outerplanar graphs.
AKCE Int. J. Graphs Comb., 2015

2014
On Reconstructing Graphs and Their Complements.
SIAM J. Discret. Math., 2014

On the k-edge magic graphs.
Electron. Notes Discret. Math., 2014

2011
Errors in graph embedding algorithms.
J. Comput. Syst. Sci., 2011

2008
Graph Reconstruction by Permutations.
Ars Comb., 2008

2007
On 3-Hypergraphs with Equal Degree Sequences.
Ars Comb., 2007

Non-Fano Quads in Finite Projective Planes.
Ars Comb., 2007

Constructing families of highly similar but non-isomorphic tournaments.
Ars Comb., 2007

2005
Graphs, algorithms and optimization.
Chapman&Hall/CRC Press, ISBN: 978-1-58488-396-8, 2005

2002
Embedding Graphs Containing K5-Subdivisions.
Ars Comb., 2002

2001
Drawing Graphs on the Torus.
Ars Comb., 2001

2000
Fano Quads in Projective Planes.
Ars Comb., 2000

1999
The Application of Determining Sets to Projective Configurations.
Ars Comb., 1999

1992
Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems.
Graphs Comb., 1992

An extension of the multi-path algorithm for finding hamilton cycles.
Discret. Math., 1992

1991
Some non-isomorphic (4t + 4, 8t + 6, 4t + 3, 2t + 2, 2t + 1)- BIBD's.
Discret. Math., 1991

On minimal neighbourhood-connected graphs.
Discret. Math., 1991

1989
A Global Measure of Network Connectivity.
J. Parallel Distributed Comput., 1989

1988
Hypomorphisms, orbits, and reconstruction.
J. Comb. Theory, Ser. B, 1988

More non-reconstructible hypergraphs.
Discret. Math., 1988

1987
A family of nonreconstructible hypergraphs.
J. Comb. Theory, Ser. B, 1987

1986
Some NP-complete problems for hypergraph degree sequences.
Discret. Appl. Math., 1986

1985
On Stockmeyer's non-reconstructible tournaments.
J. Graph Theory, 1985

On strong starters in cyclic groups.
Discret. Math., 1985

1983
Graphs with three mutually pseudo-similar vertices.
J. Comb. Theory, Ser. B, 1983

1982
Constructing graphs with pairs of pseudo-similar vertices.
J. Comb. Theory, Ser. B, 1982


  Loading...