On planar Toeplitz graphs
From MaRDI portal
Publication:367045
DOI10.1007/S00373-012-1185-8zbMATH Open1272.05166OpenAlexW1966678637MaRDI QIDQ367045FDOQ367045
Authors: Reinhardt Euler, Tudor Zamfirescu 
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1185-8
Recommendations
Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- On cliques in graphs
- The complexity of counting in sparse, regular, and planar graphs
- Hamiltonian properties of Toeplitz graphs
- On planarity and colorability of circulant graphs
- Characterizing bipartite Toeplitz graphs
- On hamiltonian Toeplitz graphs
- Coloring planar Toeplitz graphs and the stable set polytope.
- Coloring Toeplitz graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The number of maximal independent sets in connected graphs
- Integral distance graphs
- Hamiltonian cycles in directed Toeplitz graphs
- Chromatic numbers of integer distance graphs
Cited In (11)
- Coloring planar Toeplitz graphs and the stable set polytope.
- Discrete and Computational Geometry
- Riordan posets and associated incidence matrices
- The property of Hamiltonian connectedness in Toeplitz graphs
- Coloring planar Toeplitz graphs
- Structural properties of Toeplitz graphs
- Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7
- Riordan graphs I: structural properties
- Title not available (Why is that?)
- Hamiltonicity in directed Toeplitz graphs \(T_n\langle 1, 2; t_1, t_2\rangle\)
- Hamiltonian Connectedness 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)
