Friendship two-graphs (Q604993): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59560555, #quickstatements; #temporary_batch_1711504539957 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Vertex- and edge-minimal and locally minimal graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial designs related to the strong perfect graph conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3741636 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposing complete edge-chromatic graphs and hypergraphs. Revisited / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3835491 / rank | |||
Normal rank | |||
Latest revision as of 11:55, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Friendship two-graphs |
scientific article |
Statements
Friendship two-graphs (English)
0 references
12 November 2010
0 references
friendship graphs
0 references
friendship two-graphs
0 references
matrix equation
0 references
