Graphs with no induced \(C_ 4\) and \(2K_ 2\) (Q1801686): 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: Q4165164 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering the cliques of a graph with vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5749319 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Complementary Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering all cliques of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bound on the chromatic number of graphs without certain induced subgraphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90477-b / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W179301118 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with no induced \(C_ 4\) and \(2K_ 2\) |
scientific article |
Statements
Graphs with no induced \(C_ 4\) and \(2K_ 2\) (English)
0 references
20 June 1993
0 references
Nordhaus-Gaddum theorem
0 references
induced subgraph
0 references
split graphs
0 references
clique
0 references
independent set
0 references
