\(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3856672 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4770411 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00163-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W134812493 / rank | |||
Normal rank | |||
Latest revision as of 08:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(K_{1,3}\)-free and \(W_4\)-free graphs |
scientific article |
Statements
\(K_{1,3}\)-free and \(W_4\)-free graphs (English)
0 references
28 February 1997
0 references
algorithms
0 references
perfect graphs
0 references
