Linear recognition and embedding of Fibonacci cubes
From MaRDI portal
Publication:2350907
DOI10.1007/s00453-013-9839-3zbMath1325.68172OpenAlexW1997713311MaRDI QIDQ2350907
Publication date: 25 June 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9839-3
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Algorithms on strings (68W32)
Related Items (10)
\(q\)-cube enumerator polynomial of Fibonacci cubes ⋮ Vertex and edge orbits of Fibonacci and Lucas cubes ⋮ Counting disjoint hypercubes in Fibonacci cubes ⋮ The structures of bad words ⋮ Enumerative properties and cube polynomials of Tribonacci cubes ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ Binary Coding of Resonance Graphs of Catacondensed Polyhexes ⋮ On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees ⋮ On isomorphism classes of generalized Fibonacci cubes ⋮ The (non-)existence of perfect codes in Fibonacci cubes
Cites Work
- The Fibonacci dimension of a graph
- Isometric embedding in products of complete graphs
- Structure of Fibonacci cubes: a survey
- The degree sequence of Fibonacci and Lucas cubes
- Fast recognition of Fibonacci cubes
- On median nature and enumerative properties of Fibonacci-like cubes
- Recognizing binary Hamming graphs inO(n 2 logn) time
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear recognition and embedding of Fibonacci cubes