Induced Embeddings into Hamming Graphs.
DOI10.4230/LIPICS.MFCS.2017.28zbMATH Open1441.68193OpenAlexW2771182029MaRDI QIDQ5111242FDOQ5111242
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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- The NP-Completeness of Edge-Coloring
- The strong perfect graph theorem
- The square of a block graph
- Snarks without small cycles
- On Isometric Embeddings of Graphs
- Characterizing subgraphs of Hamming graphs
- On a product dimension of graphs
- On the semi-perfect elimination
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
- Representations of graphs modulo \(n\)
- On a product dimension of bipartite graphs
- Product dimension of forests and bounded treewidth graphs
- Hamming dimension of a graph-the case of Sierpiński graphs
- LexBFS-orderings and powers of chordal graphs
- Cubical graphs and cubical dimensions
- The lattice dimension of a graph
- Line-of-Sight Networks
- Complexity of dimension three and some related edge-covering characteristics of graphs
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
- Duchet-type theorems for powers of HHD-free graphs
- Queens graphs
- The strong isometric dimension of finite reflexive graphs
- Wings and perfect graphs
- A characterization of cubic lattice graphs
- Line graphs of hypergraphs. I
- The uniqueness of the cubic lattice graph
- Lexbfs-orderings and powers of hhd-free graphs∗
- Powers of hhd-free graphs∗
- Further characterizations of cubic lattice graphs
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- On induced and isometric embeddings of graphs into the strong product of paths
- Note on “A characterization of cubic lattice graphs”
- A note on the exceptional graph of the cubic lattice graph characterization
- Finding Large Independent Sets in Line of Sight Networks
Cited In (3)
This page was built for publication: Induced Embeddings into Hamming Graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111242)
