Maximum diameter of 3‐ and 4‐colorable graphs (Q6093149): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q114236118, #quickstatements; #temporary_batch_1726365119168 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3203014339 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs of maximum diameter / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diameter of 4-colourable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the maximum diameter of \(k\)-colorable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Radius, diameter, and minimum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3946193 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the diameter of a graph / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q114236118 / rank | |||
Normal rank |
Latest revision as of 03:05, 15 September 2024
scientific article; zbMATH DE number 7746567
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum diameter of 3‐ and 4‐colorable graphs |
scientific article; zbMATH DE number 7746567 |
Statements
Maximum diameter of 3‐ and 4‐colorable graphs (English)
0 references
6 October 2023
0 references
diameter
0 references
\(k\)-colorable
0 references
linear programming duality
0 references
minimum degree
0 references