Recommendations
Cites work
- scientific article; zbMATH DE number 2186905 (Why is no real title available?)
- scientific article; zbMATH DE number 5787327 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- Characterizing bipartite Toeplitz graphs
- Chromatic numbers of integer distance graphs
- Coloring Toeplitz graphs
- Coloring planar Toeplitz graphs and the stable set polytope.
- Hamiltonian cycles in directed Toeplitz graphs
- Hamiltonian properties of Toeplitz graphs
- Integral distance graphs
- On cliques in graphs
- On hamiltonian Toeplitz graphs
- On planarity and colorability of circulant graphs
- The complexity of counting in sparse, regular, and planar graphs
- The number of maximal independent sets in connected graphs
Cited in
(11)- Coloring planar Toeplitz graphs
- Riordan posets and associated incidence matrices
- The property of Hamiltonian connectedness in Toeplitz graphs
- scientific article; zbMATH DE number 5037083 (Why is no real title available?)
- Hamiltonicity in directed Toeplitz graphs \(T_n\langle 1, 2; t_1, t_2\rangle\)
- Coloring planar Toeplitz graphs and the stable set polytope.
- Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7
- Discrete and Computational Geometry
- Hamiltonian Connectedness of Toeplitz Graphs
- Riordan graphs I: structural properties
- Structural properties of Toeplitz graphs
This page was built for publication: On planar Toeplitz graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367045)