scientific article; zbMATH DE number 3618209

MaRDI QIDQ4182796zbMATH OpenFDO

Authors Martin Charles Golumbic

Publication date 1978

zbMATH Keywords

hypergraphparallel processesthreshold graphsthreshold hypergraph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hypergraphs (05C65) Theory of operating systems (68N25)

Cited in

(20)

• Threshold hypergraphs
• Structure and recognition of domishold graphs
• Asynchronous threshold networks
• Ferrers digraphs and threshold graphs
• Trivially perfect graphs
• Total matchings and total coverings of threshold graphs
• Geometric comparison of combinatorial polytopes
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• On the use of Boolean methods for the computation of the stability number
• Threshold Dimension of Graphs
• Threshold Sequences
• Letter graphs and geometric grid classes of permutations
• Labelled well-quasi-order for permutation classes
• The polytope of degree sequences
• Bipartite bithreshold graphs
• On the independence polynomial and threshold of an antiregular k-hypergraph
• Degree sequences of matrogenic graphs
• Once more on matrogenic graphs
• On shift stable hypergraphs
• A tutorial on the use of graph coloring for some problems in robotics

This page was built for publication:

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