scientific article; zbMATH DE number 942492

MaRDI QIDQ4714508zbMATH OpenFDO

Authors O. I. Mel'nikov, Yu. M. Metel'Skiĭ, Regina Iosifovna Tyshkevich

Publication date 26 February 1997

zbMATH Keywords

hypergraphpolynomial algorithmsrecognition problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the recognition complexity of some graph properties
• Recognizing cographs and threshold graphs through a classification of their edges
• Recognizing Polymatroids Associated with Hypergraphs
• On existence of hypergraphs with prescribed edge degree profile
• Developments in Language Theory
• Edge-connectivity in hypergraphs
• Edge-connection of graphs, digraphs, and hypergraphs
• Recognizing Helly edge-path-tree graphs and their clique graphs
• Recognizing hyperelliptic graphs in polynomial time
• Recognizing hyperelliptic graphs in polynomial time

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 Q4714508)