Cage-amalgamation graphs, a common generalization of chordal and median graphs
From MaRDI portal
Publication:1024305
DOI10.1016/j.ejc.2008.09.003zbMath1205.05065MaRDI 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
05C12: Distance in graphs
Related Items
Retracts of Products of Chordal Graphs, Bucolic complexes, Cube polynomial of Fibonacci and Lucas cubes
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