Algorithms on clique separable graphs (Q1246434)

From MaRDI portal

Revision as of 22:29, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Algorithms on clique separable graphs	scientific article

Statements

scholarly article

0 references

Algorithms on clique separable graphs (English)

0 references

0 references

Discrete Mathematics

0 references

publication date

1977

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

On rigid circuit graphs

0 references

0 references

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

0 references

Transitive Orientation of Graphs and Identification of Permutation Graphs

0 references

Triangulated graphs and the elimination process

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0012-365X(77)90030-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1246434

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1246434&oldid=34610960"