Henry Martyn Mulder

Orcid: 0000-0002-4776-4046

Affiliations:
  • Erasmus Universiteit, Rotterdam, The Netherlands


According to our database1, Henry Martyn Mulder authored at least 65 papers between 1978 and 2021.

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

2021
Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom.
Math. Soc. Sci., 2021

2020
The target location function on finite trees.
Discret. Appl. Math., 2020

New resolvability parameters of graphs.
AKCE Int. J. Graphs Comb., 2020

2018
A note on the interval function of a disconnected graph.
Discuss. Math. Graph Theory, 2018

Dyadic representations of graphs.
Discret. Math., 2018

Axiomatic characterization of the center function. The case of non-universal axioms.
Discret. Appl. Math., 2018

2017
Graphs constructible from cycles and complete graphs.
Discret. Math., 2017

Axiomatic characterization of the center function. The case of universal axioms.
Discret. Appl. Math., 2017

Axiomatic characterization of the median and antimedian function on a complete graph minus a matching.
Discret. Appl. Math., 2017

2016
An ABC-Problem for location and consensus functions on graphs.
Discret. Appl. Math., 2016

2015
Five axioms for location functions on median graphs.
Discret. Math. Algorithms Appl., 2015

Axiomatic characterization of the interval function of a block graph.
Discret. Math., 2015

Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2013
An axiomatic approach to location functions on finite metric spaces.
Electron. Notes Discret. Math., 2013

Path-neigborhood graphs.
Discuss. Math. Graph Theory, 2013

Guides and shortcuts in graphs.
Discret. Math., 2013

A tight axiomatization of the median procedure on median graphs.
Discret. Appl. Math., 2013

Consensus strategies for signed profiles on graphs.
Ars Math. Contemp., 2013

2012
The ℓp-function on trees.
Networks, 2012

Axiomatic Characterization of the antimedian Function on Paths and Hypercubes.
Discret. Math. Algorithms Appl., 2012

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs.
Australas. J Comb., 2012

2011
An axiomatization of the median procedure on the n-cube.
Discret. Appl. Math., 2011

2010
Axiomatic Characterization of the mean Function on Trees.
Discret. Math. Algorithms Appl., 2010

The induced path function, monotonicity and betweenness.
Discret. Appl. Math., 2010

The plurality strategy on graphs.
Australas. J Comb., 2010

2009
Axiomatic characterization of the interval function of a graph.
Eur. J. Comb., 2009

2008
Axiomization of the center function on trees.
Australas. J Comb., 2008

2006
Leaps: an approach to the block structure of a graph.
Discuss. Math. Graph Theory, 2006

The t-median function on graphs.
Discret. Appl. Math., 2006

2005
Constant tolerance intersection graphs of subtrees of a tree.
Discret. Math., 2005

Convexities related to path properties on graphs.
Discret. Math., 2005

2004
On 3-simplicial vertices in planar graphs.
Discuss. Math. Graph Theory, 2004

2003
Signpost Systems and Their Underlying Graphs.
Electron. Notes Discret. Math., 2003

Induced Path Transit Function, Betweenness and Monotonicity.
Electron. Notes Discret. Math., 2003

Modular and median signpost systems and their underlying graphs.
Discuss. Math. Graph Theory, 2003

Graphs with only caterpillars as spanning trees.
Discret. Math., 2003

The Median Function on Distributive Semilattices.
Discret. Appl. Math., 2003

2002
Partial Cubes and Crossing Graphs.
SIAM J. Discret. Math., 2002

Tiled partial cubes.
J. Graph Theory, 2002

The induced path convexity, betweenness, and svelte graphs.
Discret. Math., 2002

2000
Tolerance intersection graphs on binary trees with constant tolerance 3.
Discret. Math., 2000

The median function on median graphs and semilattices.
Discret. Appl. Math., 2000

1999
Median Graphs and Triangle-Free Graphs.
SIAM J. Discret. Math., 1999

Graphs which Locally Mirror the Hypercube Structure.
Inf. Process. Lett., 1999

Intersection graphs on trees with a tolerance.
Electron. Notes Discret. Math., 1999

1998
An Euler-type formula for median graphs.
Discret. Math., 1998

The Median Procedure on Median Graphs.
Discret. Appl. Math., 1998

1997
The vertex connectivity of a {0, 2}-graph equals its degree.
Discret. Math., 1997

The Majority Strategy on Graphs.
Discret. Appl. Math., 1997

1996
Subpath acyclic digraphs.
Discret. Math., 1996

1994
Quasi-median graphs and algebras.
J. Graph Theory, 1994

1992
Julius Petersen's theory of regular graphs.
Discret. Math., 1992

Pseudo-median graphs are join spaces.
Discret. Math., 1992

1991
Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication.
Discret. Math., 1991

1990
Metric characterization of parity graphs.
Discret. Math., 1990

1988
Regular pseudo-median graphs.
J. Graph Theory, 1988

1986
Distance-hereditary graphs.
J. Comb. Theory, Ser. B, 1986

Pseudo-modular graphs.
Discret. Math., 1986

1984
Interval-regular graphs of diameter two.
Discret. Math., 1984

1983
Infinite median graphs, (0, 2)-graphs, and hypercubes.
J. Graph Theory, 1983

1982
Interval-regular graphs.
Discret. Math., 1982

1980
<i>n</i>-cubes and median graphs.
J. Graph Theory, 1980

1979
Median graphs and Helly hypergraphs.
Discret. Math., 1979

(0, λ)-graphs and n-cubes.
Discret. Math., 1979

1978
The structure of median graphs.
Discret. Math., 1978


  Loading...