The complement of the Djoković-Winkler relation
From MaRDI portal
Publication:6658058
DOI10.1016/j.disc.2024.114328MaRDI QIDQ6658058
Bruno J. Schmidt, Sandhya Thekkumpadan Puthiyaveedu, G. E. Scholz, Marc Hellmuth
Publication date: 8 January 2025
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of block designs (05B05) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Unnamed Item
- Cut method and Djoković-Winkler's relation
- Factoring a graph in polynomial time
- Isometric embedding in products of complete graphs
- On cube-free median graphs
- Induced cycles in crossing graphs of median graphs
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Distance-hereditary graphs
- Paw-free graphs
- On metric properties of certain clique graphs
- A convexity lemma and expansion procedures for bipartite graphs
- On median graphs and median grid graphs
- Distance-preserving subgraphs of hypercubes
- The periphery graph of a median graph
- On Isometric Embeddings of Graphs
- Product graph representations
This page was built for publication: The complement of the Djoković-Winkler relation
