On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966279619 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1205.0991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On subgraphs of Cartesian product graphs and S-primeness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3005852 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A local prime factor decomposition algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4523707 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5302113 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recognizing Cartesian products in linear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On subgraphs of Cartesian product graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizing subgraphs of Hamming graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new concept of primeness in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3838189 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4065584 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank | |||
Latest revision as of 09:14, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs |
scientific article |
Statements
On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (English)
0 references
25 April 2013
0 references
graph
0 references
S-prime
0 references
S-composite
0 references
path-\(k\)-coloring
0 references
Cartesian product
0 references
NP-complete
0 references
coNP-complete
0 references
