Gary MacGillivray

,

Wendy J. Myrvold

Discret. Appl. Math., October, 2023

Efficient (j, k)-dominating functions.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2023

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs.

[BibT_eX]

[DOI]

,

Arnott Kidner

,

CoRR, 2023

Eternal domination and clique covering.

[BibT_eX]

[DOI]

,

Christina M. Mynhardt

,

Virgélot Virgile

Electron. J. Graph Theory Appl., 2022

The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial.

[BibT_eX]

[DOI]

,

Arnott Kidner

,

Discret. Math. Theor. Comput. Sci., 2022

Homomorphically Full Oriented Graphs.

[BibT_eX]

[DOI]

Thomas Bellitto

,

,

CoRR, 2022

2-limited broadcast domination in subcubic graphs.

[BibT_eX]

[DOI]

,

,

Frank Yang

Discret. Appl. Math., 2020

Colourings of (m, n)-coloured mixed graphs.

[BibT_eX]

[DOI]

,

Shahla Nasserasr

,

Feiran Yang

CoRR, 2020

The firefighter problem on orientations of the cubic grid.

[BibT_eX]

[DOI]

,

Shayla Redlin

Bull. ICA, 2020

The Firefighter problem: Saving sets of vertices on cubic graphs.

[BibT_eX]

[DOI]

,

Networks, 2019

Oriented incidence colourings of digraphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2019

Oriented colourings of graphs with maximum degree three and four.

[BibT_eX]

[DOI]

,

,

Éric Sopena

Discret. Math., 2019

Broadcast domination and multipacking in strongly chordal graphs.

[BibT_eX]

[DOI]

,

,

Feiran Yang

Discret. Appl. Math., 2019

A Study of k-dipath Colourings of Oriented Graphs.

[BibT_eX]

[DOI]

,

,

Éric Sopena

Discret. Math. Theor. Comput. Sci., 2018

Complexity of locally-injective homomorphisms to tournaments.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math. Theor. Comput. Sci., 2018

Reconfiguring minimum dominating sets: the ?-graph of a tree.

[BibT_eX]

[DOI]

Michelle Edwards

,

,

Shahla Nasserasr

Discuss. Math. Graph Theory, 2018

k-broadcast domination and k-multipacking.

[BibT_eX]

[DOI]

,

,

Frank Yang

Discret. Appl. Math., 2018

Perfect Roman domination in trees.

[BibT_eX]

[DOI]

,

William F. Klostermeyer

,

Discret. Appl. Math., 2018

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Ruth Haas

,

Algorithms, 2018

Eternal domination: criticality and reachability.

[BibT_eX]

[DOI]

William F. Klostermeyer

,

Discuss. Math. Graph Theory, 2017

Bounds for the $m$-Eternal Domination Number of a Graph.

[BibT_eX]

[DOI]

,

William Klostermeyer

,

Contributions Discret. Math., 2017

Characterizations and algorithms for generalized Cops and Robbers games.

[BibT_eX]

[DOI]

Anthony Bonato

,

Contributions Discret. Math., 2017

Safe set problem on graphs.

[BibT_eX]

[DOI]

Shinya Fujita

,

,

Tadashi Sakuma

Discret. Appl. Math., 2016

Obstructions to locally injective oriented improper colourings.

[BibT_eX]

[DOI]

,

André Raspaud

,

Eur. J. Comb., 2014

Conditional Colourings with Given Template.

[BibT_eX]

[DOI]

Peter Dukes

,

Steve Lowdon

,

Discret. Math. Theor. Comput. Sci., 2014

A simple method of computing the catch time.

[BibT_eX]

[DOI]

Nancy E. Clarke

,

Stephen Finbow

,

Ars Math. Contemp., 2014

A theory of 2-dipath colourings.

[BibT_eX]

[DOI]

,

Kailyn M. Sherk

Australas. J Comb., 2014

Weak near-unanimity functions and digraph homomorphism problems.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2013

Efficient domination in circulant graphs.

[BibT_eX]

[DOI]

K. Reji Kumar

,

Discret. Math., 2013

Characterizations of k-copwin graphs.

[BibT_eX]

[DOI]

Nancy E. Clarke

,

Discret. Math., 2012

The diameter of total domination and independent domination vertex-critical graphs.

[BibT_eX]

[DOI]

Michelle Edwards

,

Australas. J Comb., 2012

Obstructions to Injective Oriented Colourings.

[BibT_eX]

[DOI]

,

André Raspaud

,

Electron. Notes Discret. Math., 2011

The Ck-extended graft construction.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2011

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles.

[BibT_eX]

[DOI]

,

,

Contributions Discret. Math., 2011

Gray code numbers for graphs.

[BibT_eX]

[DOI]

Kelly Choo

,

Ars Math. Contemp., 2011

Structure of the set of all minimal total dominating functions of some classes of graphs.

[BibT_eX]

[DOI]

K. Reji Kumar

,

Discuss. Math. Graph Theory, 2010

The complexity of locally injective homomorphisms.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

The firefighter problem for cubic graphs.

[BibT_eX]

[DOI]

Andrew D. King

,

Discret. Math., 2010

The complexity of colouring by locally semicomplete digraphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2010

On the complexity of H-colouring planar graphs.

[BibT_eX]

[DOI]

,

Mark H. Siggers

Discret. Math., 2009

The circular chromatic number of hypergraphs.

[BibT_eX]

[DOI]

,

,

Laura Shepherd

Discret. Math., 2009

The Firefighter Problem: a survey of results, directions and questions.

[BibT_eX]

[DOI]

Stephen Finbow

,

Australas. J Comb., 2009

Near-Unanimity Functions and Varieties of Reflexive Graphs.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2008

On Maximal Fractional Independent Sets In Graphs.

[BibT_eX]

K. Reji Kumar

,

S. Arumugam

,

Ars Comb., 2008

The firefighter problem for graphs of maximum degree three.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2007

Bounds on the achromatic number of partial triple systems.

[BibT_eX]

[DOI]

Peter Dukes

,

,

Kristen Parton

Contributions Discret. Math., 2007

A note on k-cop, l-robber games on graphs.

[BibT_eX]

[DOI]

Gena Hahn

,

Discret. Math., 2006

Building blocks for the variety of absolute retracts.

[BibT_eX]

[DOI]

,

Discret. Math., 2006

Non 3-Choosable Bipartite Graphs and The Fano Plane.

[BibT_eX]

Shannon L. Fitzpatrick

,

Ars Comb., 2005

Analogues of cliques for oriented coloring.

[BibT_eX]

[DOI]

William Klostermeyer

,

Discuss. Math. Graph Theory, 2004

Homomorphisms and oriented colorings of equivalence classes of oriented graphs.

[BibT_eX]

[DOI]

William Klostermeyer

,

Discret. Math., 2004

Bounds For Partial List Colourings.

[BibT_eX]

Ruth Haas

,

,

Ars Comb., 2003

Total domination in complements of graphs containing no K4, 4.

[BibT_eX]

[DOI]

Shannon L. Fitzpatrick

,

,

Devon McCrea

Discret. Math., 2002

Star forests, dominating sets and Ramsey-type problems.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2002

Pushing vertices in digraphs without long induced cycles.

[BibT_eX]

[DOI]

Jing Huang

,

,

Anders Yeo

Discret. Appl. Math., 2002

The achromatic number of the union of paths.

[BibT_eX]

[DOI]

,

A. Rodriguez

Discret. Math., 2001

Pushing the cycles out of multipartite tournaments.

[BibT_eX]

[DOI]

Jing Huang

,

,

Kathryn L. B. Wood

Discret. Math., 2001

Minimizing b + D and well covered graphs.

[BibT_eX]

,

Ars Comb., 2001

Classes of line graphs with small cycle double covers.

[BibT_eX]

[DOI]

,

Karen Seyffarth

Australas. J Comb., 2001

CO-irredundant Ramsey numbers for graphs.

[BibT_eX]

[DOI]

Ernest J. Cockayne

,

,

Jill Simmons

J. Graph Theory, 2000

Re-Orienting Tournaments by Pushing Vertices.

[BibT_eX]

,

Kathryn L. B. Wood

Ars Comb., 2000

The complexity of restricted graph homomorphisms.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1997

Domination numbers of planar graphs.

[BibT_eX]

[DOI]

,

Karen Seyffarth

J. Graph Theory, 1996

Domination critical graphs with higher independent domination numbers.

[BibT_eX]

[DOI]

S. Ao

,

Ernest J. Cockayne

,

,

Christina M. Mynhardt

J. Graph Theory, 1996

Homomorphically Full Graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 1996

Choosability of bipartite graphs.

[BibT_eX]

,

,

Bjarne Toft

Ars Comb., 1996

Vertex domination-critical graphs.

[BibT_eX]

[DOI]

Jason Fulman

,

,

Networks, 1995

Hereditarily hard H-colouring problems.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1995

A note on minimum graphs with girth pair (4, 2l + 1).

[BibT_eX]

[DOI]

,

Ping Wang

,

J. Graph Theory, 1994

Convexity of minimal dominating functions of trees - II.

[BibT_eX]

[DOI]

Ernest J. Cockayne

,

,

Christina M. Mynhardt

Discret. Math., 1994

Graph Homomorphisms with Infinite Targets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

The size of a minimum five-chromatic K4-free graph.

[BibT_eX]

[DOI]

,

,

Dale Youngs

Discret. Math., 1993

On the complexity of colouring by superdigraphs of bipartite graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1992

On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

A Note on Restricted H-Colouring.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 1991

The product of the independent domination numbers of a graph and its complement.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1991

A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs.

[BibT_eX]

[DOI]

John A. Ellis

,

Manrique Mata

,

Inf. Process. Lett., 1989

The Complexity of Colouring by Semicomplete Digraphs.

[BibT_eX]

[DOI]

,

,