Coloring planar Toeplitz graphs and the stable set polytope.
From MaRDI portal
Publication:1422423
DOI10.1016/S0012-365X(03)00315-7zbMath1039.05030MaRDI QIDQ1422423
Publication date: 14 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items
On Super Edge-Antimagic Total Labeling of Toeplitz Graphs ⋮ Structural properties of Toeplitz graphs ⋮ On planar Toeplitz graphs ⋮ On the chromatic number of Toeplitz graphs ⋮ Riordan graphs I: structural properties ⋮ Unnamed Item ⋮ ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring the real line
- Colouring prime distance graphs
- Hamiltonian properties of Toeplitz graphs
- Efficiently solvable special cases of bottleneck travelling salesman problems
- On hamiltonian Toeplitz graphs
- The chromatic numbers of distance graphs
- Hamiltonian cycles in circulant digraphs with two stripes
- On certain polytopes associated with graphs
- On planarity and colorability of circulant graphs
- On critical edges in minimal imperfect graphs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Integral distance graphs
- On the facial structure of set packing polyhedra
- 25 pretty graph colouring problems
- Chromatic numbers of integer distance graphs
- Characterizing bipartite Toeplitz graphs
