Some results on the complexity of families of sets

DOI10.1016/0012-365X(91)90008-PzbMath0762.05091OpenAlexW1980071981MaRDI QIDQ1176725

Daniel Grieser

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90008-p

zbMATH Keywords

complexitygraph propertiesfamilies of setsscorpion graph

Mathematics Subject Classification ID

2-person games (91A05) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On the recognition complexity of some graph properties ⋮ On the elusiveness of Hamiltonian property

Cites Work

• Packings of graphs and applications to computational complexity
• On the time required to detect cycles and connectivity in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some results on the complexity of families of sets