A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (Q4368813): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
label / en | label / en | ||
A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3035337 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random packings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3398531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomly decomposable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomly matchable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.21136/cmj.1996.127306 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2739395371 / rank | |||
Normal rank | |||
Property / title | |||
A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (English) | |||
Property / title: A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (English) / rank | |||
Normal rank |
Latest revision as of 09:29, 30 July 2024
scientific article; zbMATH DE number 1095783
Language | Label | Description | Also known as |
---|---|---|---|
English | A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs |
scientific article; zbMATH DE number 1095783 |
Statements
10 December 1997
0 references
decompositions
0 references
factors
0 references
decomposable graphs
0 references
forbidden subgraph characterization
0 references
A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (English)
0 references