On planar Toeplitz graphs

DOI10.1007/s00373-012-1185-8zbMath1272.05166OpenAlexW1966678637MaRDI QIDQ367045

Reinhardt Euler, Tudor I. 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

zbMATH Keywords

colouringcountingplanarityToeplitz graphmaximal independent set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items

Hamiltonian Connectedness of Toeplitz Graphs ⋮ Structural properties of Toeplitz graphs ⋮ The property of Hamiltonian connectedness in Toeplitz graphs ⋮ Riordan posets and associated incidence matrices ⋮ Riordan graphs I: structural properties ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian properties of Toeplitz graphs
• On hamiltonian Toeplitz graphs
• On planarity and colorability of circulant graphs
• Coloring planar Toeplitz graphs and the stable set polytope.
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• Coloring Toeplitz graphs
• The number of maximal independent sets in connected graphs
• Integral distance graphs
• On cliques in graphs
• Chromatic numbers of integer distance graphs
• Characterizing bipartite Toeplitz graphs

This page was built for publication: On planar Toeplitz graphs