Michael D. Plummer

,

Bill Jackson

,

J. Graph Theory, October, 2023

A characterization of well-indumatchable graphs having girth greater than seven.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2022

Asymmetric distance matching extension.

[BibT_eX]

[DOI]

,

Watcharintorn Ruksasakchai

,

Australas. J Comb., 2021

Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane.

[BibT_eX]

[DOI]

,

Watcharintorn Ruksasakchai

,

J. Graph Theory, 2020

Extendability and Criticality in Matching Theory.

[BibT_eX]

[DOI]

,

Graphs Comb., 2020

Dominating maximal outerplane graphs and Hamiltonian plane triangulations.

[BibT_eX]

[DOI]

,

Dong Ye

,

Discret. Appl. Math., 2020

On the structure of 4-regular planar well-covered graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2020

Restricted matching in plane triangulations and near triangulations.

[BibT_eX]

[DOI]

,

Watcharintorn Ruksasakchai

,

Discret. Appl. Math., 2020

Cycle Traversability for Claw-Free Graphs and Polyhedral Maps.

[BibT_eX]

[DOI]

,

,

,

Comb., 2020

Matching Extension Missing Vertices and Edges in Triangulations of Surfaces.

[BibT_eX]

[DOI]

,

Kenta Ozeki

,

J. Graph Theory, 2017

Toughness, binding number and restricted matching extension in a graph.

[BibT_eX]

[DOI]

,

Discret. Math., 2017

Connectivity and W<sub>v</sub> -Paths in Polyhedral Maps on Surfaces.

[BibT_eX]

[DOI]

,

Dong Ye

,

Discret. Comput. Geom., 2017

On well-covered pentagonalizations of the plane.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2017

Matching extension in prism graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2017

Dominating plane triangulations.

[BibT_eX]

[DOI]

,

Dong Ye

,

Discret. Appl. Math., 2016

Well-covered triangulations: Part IV.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

Perfect matchings avoiding prescribed edges in a star-free graph.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2015

Matching extension in toroidal quadrangulations II: the 3-extendable case.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., 2015

A Note on Cyclic Connectivity and Matching Properties of Regular Graphs.

[BibT_eX]

[DOI]

,

Tao Wang

,

Qinglin Yu

Graphs Comb., 2014

A note on graphs contraction-critical with respect to independence number.

[BibT_eX]

[DOI]

,

Discret. Math., 2014

On a Conjecture Concerning the Petersen Graph: Part II.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2014

Forbidden subgraphs generating a finite set.

[BibT_eX]

[DOI]

Jun Fujisawa

,

,

Discret. Math., 2013

Matching extension in quadrangulations of the torus.

[BibT_eX]

[DOI]

,

,

,

Australas. J Comb., 2013

Linkage for the diamond and the path with four vertices.

[BibT_eX]

[DOI]

Mark N. Ellingham

,

,

Gexin Yu

J. Graph Theory, 2012

Proximity thresholds for matching extension in the torus and Klein bottle.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

Graphs with the cycle extension property.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2012

Forbidden triples for perfect matchings.

[BibT_eX]

[DOI]

Katsuhiro Ota

,

,

J. Graph Theory, 2011

Proximity thresholds for matching extension in planar and projective planar triangulations.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2011

The 2-extendability of 5-connected graphs on surfaces with large representativity.

[BibT_eX]

[DOI]

,

Seiya Negami

,

,

Yusuke Suzuki

J. Comb. Theory, Ser. B, 2011

On a Conjecture Concerning the Petersen Graph.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2011

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.

[BibT_eX]

[DOI]

,

,

,

,

Comb., 2011

A note on traversing specified vertices in graphs embedded with large representativity.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

Distance-restricted matching extension in planar triangulations.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

On well-covered triangulations: Part III.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2010

Bounding the Size of Equimatchable Graphs of Fixed Genus.

[BibT_eX]

[DOI]

,

Graphs Comb., 2009

On certain spanning subgraphs of embeddings with applications to domination.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

On well-covered triangulations: Part II.

[BibT_eX]

[DOI]

Art S. Finbow

,

,

,

Discret. Appl. Math., 2009

On the matching extendability of graphs in surfaces.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory, Ser. B, 2008

Matching properties in connected domination critical graphs.

[BibT_eX]

[DOI]

,

Watcharaphong Ananchuen

,

Discret. Math., 2008

Restricted matching in graphs of small genus.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Graph factors and factorization: 1985-2003: A survey.

[BibT_eX]

[DOI]

Discret. Math., 2007

3-Factor-criticality in domination critical graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2007

Matchings in 3-vertex-critical graphs: The odd case.

[BibT_eX]

[DOI]

,

Discret. Math., 2007

Domination in a graph with a 2-factor.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2006

A pair of forbidden subgraphs and perfect matchings.

[BibT_eX]

[DOI]

Shinya Fujita

,

Cláudio Leonardo Lucchesi

,

,

Katsuhiro Ota

,

,

J. Comb. Theory, Ser. B, 2006

Some recent results on domination in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15].

[BibT_eX]

[DOI]

,

Discret. Math., 2006

Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13].

[BibT_eX]

[DOI]

,

Discret. Math., 2006

Matchings in 3-vertex-critical graphs: The even case.

[BibT_eX]

[DOI]

,

Networks, 2005

Forbidden subgraphs and bounds on the size of a maximum matching.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2005

Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture.

[BibT_eX]

[DOI]

,

,

Bjarne Toft

J. Comb. Theory, Ser. B, 2005

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree.

[BibT_eX]

[DOI]

Michael A. Henning

,

J. Comb. Optim., 2005

On the <i>p</i>-factor-criticality of the Klein bottle.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Matching properties in domination critical graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Edge proximity and matching extension in planar triangulations.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2004

On a special case of Hadwiger's conjecture.

[BibT_eX]

[DOI]

,

Michael Stiebitz

,

Bjarne Toft

Discuss. Math. Graph Theory, 2003

On two equimatchable graph classes.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2003

Some results related to the toughness of 3-domination critical graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

On well-covered triangulations: Part I.

[BibT_eX]

[DOI]

Art S. Finbow

,

,

,

Discret. Appl. Math., 2003

Genus bounds for embeddings with large minimum degree and representativity.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Isoperimetric Constants of Infinite Plane Graphs.

[BibT_eX]

[DOI]

Serge Lawrencenko

,

,

Discret. Comput. Geom., 2002

On the Connectivity of Graphs Embedded in Surfaces II.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2002

On restricted matching extension in planar graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

Bounds for isoperimetric constants of infinite plane graphs.

[BibT_eX]

[DOI]

Serge Lawrencenko

,

,

Discret. Appl. Math., 2001

Closure and factor-critical graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2000

Neighborhood unions and factor critical graphs.

[BibT_eX]

[DOI]

Hikoe Enomoto

,

,

Discret. Math., 1999

On matching extensions with prescribed and proscribed edge sets II.

[BibT_eX]

[DOI]

,

Discret. Math., 1999

Two results on matching extensions with prescribed and proscribed edge sets.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1999

On the Connectivity of Graphs Embedded in Surfaces.

[BibT_eX]

[DOI]

,

J. Comb. Theory, Ser. B, 1998

Maximum and minimum toughness of graphs of small genus.

[BibT_eX]

[DOI]

Wayne Goddard

,

,

Henda C. Swart

Discret. Math., 1997

Extending matchings in planar graphs V.

[BibT_eX]

[DOI]

Discret. Math., 1996

On 4-connected Claw-free Well-covered Graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 1996

Extending matchings in graphs: A survey.

[BibT_eX]

[DOI]

Discret. Math., 1994

Extending matchings in claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Extending matchings in planar graphs IV.

[BibT_eX]

[DOI]

Discret. Math., 1992

Matching theory - a sampler: from Dénes König to the present.

[BibT_eX]

[DOI]

Discret. Math., 1992

The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable.

[BibT_eX]

[DOI]

Ervin Györi

,

Discret. Math., 1992

On the 2-extendability of planar graphs.

[BibT_eX]

[DOI]

Derek A. Holton

,

Dingjun Lou

,

Discret. Math., 1991

Matching extension and the genus of a graph.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1988

Toughness and matching extension in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1988

Cyclic coloration of 3-polytopes.

[BibT_eX]

[DOI]

,

Bjarne Toft

J. Graph Theory, 1987

A nine point theorem for 3-connected graphs.

[BibT_eX]

[DOI]

,

,

,

Comb., 1982

On n-extendable graphs.

[BibT_eX]

[DOI]

Discret. Math., 1980

On minimal elementary bipartite graphs.

[BibT_eX]

[DOI]

László Lovász

,

J. Comb. Theory, Ser. B, 1977

Path traversability in planar graphs.

[BibT_eX]

[DOI]