The following pages link to Marc Hellmuth (Q340607):
Displaying 50 items.
- Associativity and non-associativity of some hypergraph products (Q340610) (← links)
- Unique square property, equitable partitions, and product-like graphs (Q394372) (← links)
- On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282) (← links)
- A local prime factor decomposition algorithm (Q536219) (← links)
- Local algorithms for the prime factorization of strong product graphs (Q626891) (← links)
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime (Q658020) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Spiders can be recognized by counting their legs (Q904532) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- Approximate graph products (Q1024311) (← links)
- The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
- Inferring phylogenetic trees from the knowledge of rare evolutionary events (Q1750644) (← links)
- Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
- Partial homology relations -- satisfiability in terms of di-cographs (Q1790998) (← links)
- Orthology relations, symbolic ultrametrics, and cographs (Q1937881) (← links)
- A survey on hypergraph products (Q1948609) (← links)
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105) (← links)
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
- Corrigendum to: ``Best match graphs'' (Q2022091) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- Best match graphs with binary trees (Q2062000) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- Compatibility of partitions with trees, hierarchies, and split systems (Q2127632) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs (Q2254071) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- Best match graphs and reconciliation of gene trees with species trees (Q2303745) (← links)
- Alternative characterizations of Fitch's xenology relation (Q2315209) (← links)
- Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees (Q2322864) (← links)
- Reconciling event-labeled gene trees with MUL-trees and species networks (Q2330637) (← links)
- Best match graphs (Q2420450) (← links)
- Strong products of hypergraphs: unique prime factorization theorems and algorithms (Q2449107) (← links)
- Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
- Complexity of modification problems for best match graphs (Q2661779) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Planar median graphs and cubesquare-graphs (Q2691567) (← links)
- Quasi-best match graphs (Q2691571) (← links)
- The Cartesian product of hypergraphs (Q2888888) (← links)
- The Relaxed Square Property (Q2947396) (← links)
- Convex cycle bases (Q3191452) (← links)
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
- Simultaneous Credible Regions for Multiple Changepoint Locations (Q3391232) (← links)
- Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences (Q3394467) (← links)
- Fast recognition of partial star products and quasi cartesian products (Q3465660) (← links)
- A note on quasi-robust cycle bases (Q3552336) (← links)
- Minimum cycle bases of lexicographic products (Q4906171) (← links)
- Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees (Q5038192) (← links)
- Construction of k-matchings in graph products (Q5058206) (← links)
