Kieka Mynhardt, University of Victoria

Research

Read how they describe their research on their University of Victoria profile.

Latest papers

Maximum boundary independent broadcasts in graphs and trees
Electronic Journal of Graph Theory and Applications · 2025 · senior author
Lower boundary independent and hearing independent broadcasts in graphs
Discussiones Mathematicae Graph Theory · 2024 · senior author
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets
Annales Mathematicae Silesianae · 2024

All 125 publications

125 publications.

01

Maximum boundary independent broadcasts in graphs and trees

Julia Ingrid Hoepner, Gary MacGillivray, Christina M. Mynhardt

Electronic Journal of Graph Theory and Applications2025Senior authorOpen Access

DOI: 10.5614/ejgta.2025.13.2.1

02

Lower boundary independent and hearing independent broadcasts in graphs

Julia Ingrid Hoepner, Gary MacGillivray, Christina M. Mynhardt

Discussiones Mathematicae Graph Theory2024Senior authorOpen Access

DOI: 10.7151/dmgt.2546

03

The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets

Richard C. Brewster, Christina M. Mynhardt, L.E. Teshima

Annales Mathematicae Silesianae2024Open Access

DOI: 10.2478/amsil-2024-0002 PMID: 40290787

04

Irredundance graphs

Christina M. Mynhardt, Adriana Roux

Discrete Applied Mathematics20222 citationsFirst authorOpen Access

DOI: 10.1016/j.dam.2022.08.005

05

Irredundance trees of diameter 3

Christina M. Mynhardt, Adriana Roux

Discrete Mathematics20221 citationsFirst author

DOI: 10.1016/j.disc.2022.113079

06

Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs

MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann

Discussiones Mathematicae Graph Theory2021Open Access

DOI: 10.7151/dmgt.2407

07

Lower Bound and Exact Values for the Boundary Independence Broadcast Number of a Tree

Christina M. Mynhardt, L. Neilson

arXiv (Cornell University)2021First authorOpen Access

DOI: 10.48550/arxiv.2105.02312

08

Comparing Upper Broadcast Domination and Boundary Independence Numbers of Graphs

Christina M. Mynhardt, L. Neilson

arXiv (Cornell University)2021First authorOpen Access

DOI: 10.48550/arxiv.2104.02257

09

A Sharp Upper Bound for the Boundary Independence Broadcast Number of a Tree

Christina M. Mynhardt, L. Neilson

arXiv (Cornell University)2021First authorOpen Access

DOI: 10.48550/arxiv.2104.02266

10

Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges

Christina M. Mynhardt, Ana Wright

arXiv (Cornell University)2021First authorOpen Access

DOI: 10.48550/arxiv.2108.07890

Frequent collaborators

Mathematics and Statistics
Math Statistics
Department of Mathematics and Statistics
Mathematics, Statistics and Computer Science
Other

Co-authors at University of Victoria, colored by department. Thicker lines mean more shared papers; select anyone to open their profile and their own map.

Christina Mynhardt

Department of Mathematics and Statistics

125 shared papers, latest 2025

Richard Brewster

Mathematics and Statistics

4 shared papers, latest 2024

Ortrud Oellermann

Mathematics and Statistics

2 shared papers, latest 2021

Stephen Finbow

Mathematics, Statistics and Computer Science

1 shared papers, latest 2008

Write to this professor

A short, specific email works best. This draft uses one of their recent papers; replace the parts in brackets with your own details before sending.

Applying for

Paper to mention

Subject: Prospective PhD student Dear Professor Mynhardt, My name is [your name], and I am a [your current degree or role] at [your institution]. I am applying for a PhD position starting in [term and year]. I read your paper "Maximum boundary independent broadcasts in graphs and trees" (2025), and it connects closely to my own work on [your research topic]. [One or two sentences on what you did and what you learned.] Are you accepting new PhD students for [term and year]? I have attached my CV and transcripts, and I would be glad to talk at a time that suits you. Thank you for your time. Kind regards, [your name]