Counting representable sets on simple graphs
type: Item
instance of: scholarly article
title: Counting representable sets on simple graphs
zbMATH Open document ID: 0792.05054
DOI: 10.1016/0166-218X(93)90150-M
published in: Discrete Applied Mathematics
publication date: 1994-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 501143
zbMATH Keywords: counting
zbMATH Keywords: colourings
zbMATH Keywords: representable set
zbMATH Keywords: cycle-free
zbMATH Keywords: series-parallel
author: P. Jeavons
MaRDI profile type: Publication
cites work: Q4770409
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Topology of series-parallel networks
cites work: A sufficient condition for backtrack-bounded search
cites work: The Consistent Labeling Problem: Part I
cites work: Inertia characteristics of self-adjoint matrix polynomials
cites work: Networks of constraints: Fundamental properties and applications to picture processing
Recommended article: On representable graphs
Recommended article: Representation numbers of complete multipartite graphs
Recommended article: Counting independent sets in graphs
Recommended article: Enumeration of simple complete topological graphs
Recommended article: The representation number of some sparse graphs
Recommended article: Counting dominating sets and related structures in graphs
Recommended article: Q4510677
Recommended article: Q4996510
Recommended article: Dominating Set Counting in Graph Classes
description: scientific article; zbMATH DE number 501143