Induced Embeddings into Hamming Graphs.
DOI10.4230/LIPIcs.MFCS.2017.28zbMath1441.68193OpenAlexW2771182029MaRDI QIDQ5111242
Marcelo Mydlarz, Peter Mursic, Martin Milanič
Publication date: 26 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8128/pdf/LIPIcs-MFCS-2017-28.pdf/
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Product dimension of forests and bounded treewidth graphs
- Hamming dimension of a graph-the case of Sierpiński graphs
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
- The strong perfect graph theorem
- The square of a block graph
- Cubical graphs and cubical dimensions
- Wings and perfect graphs
- On a product dimension of graphs
- Complexity of dimension three and some related edge-covering characteristics of graphs
- Line graphs of hypergraphs. I
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
- Queens graphs
- LexBFS-orderings and powers of chordal graphs
- Duchet-type theorems for powers of HHD-free graphs
- Representations of graphs modulo \(n\)
- The lattice dimension of a graph
- On the semi-perfect elimination
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- Snarks without small cycles
- On induced and isometric embeddings of graphs into the strong product of paths
- A note on the exceptional graph of the cubic lattice graph characterization
- Further characterizations of cubic lattice graphs
- Finding Large Independent Sets in Line of Sight Networks
- On a product dimension of bipartite graphs
- Line-of-Sight Networks
- On Isometric Embeddings of Graphs
- The NP-Completeness of Edge-Coloring
- Graph Classes: A Survey
- Lexbfs-orderings and powers of hhd-free graphs∗
- Powers of hhd-free graphs∗
- The strong isometric dimension of finite reflexive graphs
- Characterizing subgraphs of Hamming graphs
- A characterization of cubic lattice graphs
- The uniqueness of the cubic lattice graph
- Note on “A characterization of cubic lattice graphs”
This page was built for publication: Induced Embeddings into Hamming Graphs.
