On the natural imprint function of a graph

DOI10.1006/eujc.2001.0555zbMath1002.05061OpenAlexW2008868932MaRDI QIDQ1348742

Boštjan Brešar

Publication date: 7 January 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2001.0555

zbMATH Keywords

characterizationsHamming graphisometric embeddingCartesian productsquasi-median graphsmedian graphsamalgamation procedurefixed box theoremimprint function

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (5)

The algebra of metric betweenness. I: Subdirect representation and retraction ⋮ Hosoya polynomials under gated amalgamations ⋮ Crossing graphs of fiber-complemented graphs ⋮ Crossing graphs of fiber-complemented graphs ⋮ On the canonical metric representation, average distance, and partial Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic location problem for graphs
• Prefibers and the cartesian product of metric spaces
• Isometric embedding in products of complete graphs
• On the Helly property working as a compactness criterion on graphs
• Isometric embeddings in Hamming graphs
• Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
• The retracts of Hamming graphs
• The structure of median graphs
• A convexity lemma and expansion procedures for bipartite graphs
• A fixed box theorem for the cartesian product of graphs and metric spaces
• Decomposition and \(l_1\)-embedding of weakly median graphs
• Absolute retracts of bipartite graphs
• The smallest graph variety containing all paths
• Fiber-complemented graphs. I: Structure and invariant subgraphs
• The median function on median graphs and semilattices
• Distance-preserving subgraphs of hypercubes
• Absolute Retracts and Varieties of Reflexive Graphs
• Retracts of hypercubes
• On Isometric Embeddings of Graphs
• Minimal extensions of graphs to absolute retracts
• n‐cubes and median graphs
• Fixed-edge theorem for graphs with loops
• Product graph representations
• Quasi‐median graphs and algebras
• Isometric subgraphs of Hamming graphs and d-convexity
• On the Addressing Problem for Loop Switching
• Partial Hamming graphs and expansion procedures

This page was built for publication: On the natural imprint function of a graph