Cage-amalgamation graphs, a common generalization of chordal and median graphs

DOI10.1016/j.ejc.2008.09.003zbMath1205.05065OpenAlexW1966969836MaRDI QIDQ1024305

Aleksandra Tepeh Horvat, Boštjan Brešar

Publication date: 17 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.003

zbMATH Keywords

chordal graphsmedian graphsHamming polynomialcage-amalgamation graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (3)

Bucolic complexes ⋮ Cube polynomial of Fibonacci and Lucas cubes ⋮ Retracts of Products of Chordal Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamming polynomials and their partial derivatives
• Isometric embeddings in Hamming graphs
• Decomposition and \(l_1\)-embedding of weakly median graphs
• Fiber-complemented graphs. I: Structure and invariant subgraphs
• Two relations for median graphs
• The cube polynomial and its derivatives: The case of median graphs
• Distance-preserving subgraphs of hypercubes
• Graph Classes: A Survey
• Quasi‐median graphs and algebras
• Arboreal structure and regular graphs of median-like classes
• Crossing graphs of fiber-complemented graphs

This page was built for publication: Cage-amalgamation graphs, a common generalization of chordal and median graphs