Counting representable sets on simple graphs

DOI10.1016/0166-218X(93)90150-MMaRDI QIDQ1314321zbMATH OpenFDO

Authors P. Jeavons

Publication date 22 February 1994

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

Full work available at URL https://doi.org/10.1016/0166-218X(93)90150-M

zbMATH Keywords

colouringscountingcycle-freerepresentable setseries-parallel

Mathematics Subject Classification ID

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

Recommendations

• On representable graphs
• Representation numbers of complete multipartite graphs
• Counting independent sets in graphs
• Enumeration of simple complete topological graphs
• Enumeration of simple complete topological graphs
• The representation number of some sparse graphs
• Counting dominating sets and related structures in graphs
• scientific article; zbMATH DE number 1522332
• Graph-based counting theory and its applications
• Dominating Set Counting in Graph Classes

Cites work

• A sufficient condition for backtrack-bounded search
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• Inertia characteristics of self-adjoint matrix polynomials
• Network-based heuristics for constraint-satisfaction problems
• Networks of constraints: Fundamental properties and applications to picture processing
• The Consistent Labeling Problem: Part I
• Topology of series-parallel networks

Cited in

(3)

• Decomposing constraint satisfaction problems using database techniques
• Combinatorial aspects of an exact sequence that is related to a graphs
• The representation number of some sparse graphs

This page was built for publication: Counting representable sets on simple graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314321)