The following pages link to Henry Martyn Mulder (Q290092):
Displayed 50 items.
- An ABC-problem for location and consensus functions on graphs (Q290094) (← links)
- Guides and shortcuts in graphs (Q383749) (← links)
- An axiomatization of the median procedure on the \(n\)-cube (Q540156) (← links)
- Pseudo-median graphs are join spaces (Q686278) (← links)
- \((0,\lambda)\)-graphs and \(n\)-cubes (Q755594) (← links)
- The target location function on finite trees (Q777399) (← links)
- Interval-regular graphs (Q795060) (← links)
- Interval-regular graphs of diameter two (Q796550) (← links)
- The \(t\)-median function on graphs (Q858309) (← links)
- The induced path function, monotonicity and betweenness (Q968160) (← links)
- Axiomatic characterization of the interval function of a graph (Q1024316) (← links)
- Distance-hereditary graphs (Q1084114) (← links)
- Pseudo-modular graphs (Q1084416) (← links)
- Metric characterization of parity graphs (Q1182856) (← links)
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication (Q1182965) (← links)
- Julius Petersen's theory of regular graphs (Q1198642) (← links)
- The structure of median graphs (Q1252247) (← links)
- Median graphs and Helly hypergraphs (Q1252871) (← links)
- Item:Q290092 (redirect page) (← links)
- The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree (Q1357731) (← links)
- The majority strategy on graphs (Q1377621) (← links)
- The median procedure on median graphs (Q1392574) (← links)
- Graphs with only caterpillars as spanning trees (Q1415546) (← links)
- An Euler-type formula for median graphs (Q1584314) (← links)
- Graphs which locally mirror the hypercube structure (Q1606972) (← links)
- The induced path convexity, betweenness, and svelte graphs (Q1613551) (← links)
- A note on the interval function of a disconnected graph (Q1692623) (← links)
- Axiomatic characterization of the center function. The case of non-universal axioms (Q1752587) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Convexities related to path properties on graphs (Q1772411) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- The median function on distributive semilattices (Q1874542) (← links)
- Subpath acyclic digraphs (Q1918551) (← links)
- A tight axiomatization of the median procedure on median graphs (Q1946227) (← links)
- Tolerance intersection graphs on binary trees with constant tolerance 3 (Q1974525) (← links)
- The median function on median graphs and semilattices (Q1975374) (← links)
- Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom (Q2019362) (← links)
- On EOQ cost models with arbitrary purchase and transportation costs (Q2351281) (← links)
- Axiomatic characterization of the center function. the case of universal axioms (Q2357132) (← links)
- Axiomatic characterization of the median and antimedian function on a complete graph minus a matching (Q2357160) (← links)
- Graphs constructible from cycles and complete graphs (Q2359972) (← links)
- Axiomatic characterization of the interval function of a block graph (Q2407023) (← links)
- Quorum colorings of graphs (Q2443417) (← links)
- (Q2717917) (← links)
- (Q2741354) (← links)
- (Q2760950) (← links)
- The All-Paths Transit Function of a Graph (Q2760973) (← links)
- (Q2765167) (← links)
- Partial Cubes and Crossing Graphs (Q2784514) (← links)
- Consensus strategies for signed profiles on graphs (Q2925431) (← links)