Counting representable sets on simple graphs

DOI10.1016/0166-218X(93)90150-MzbMath0792.05054MaRDI QIDQ1314321

Peter G. Jeavons

Publication date: 22 February 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

representable setcountingcolouringscycle-freeseries-parallel

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items

Decomposing constraint satisfaction problems using database techniques

Cites Work

• Unnamed Item
• Inertia characteristics of self-adjoint matrix polynomials
• Network-based heuristics for constraint-satisfaction problems
• Networks of constraints: Fundamental properties and applications to picture processing
• Topology of series-parallel networks
• A sufficient condition for backtrack-bounded search
• The Consistent Labeling Problem: Part I