Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs (Q1839257): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123155925 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:48, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs |
scientific article |
Statements
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs (English)
0 references
1982
0 references
critical k-chromatic graphs
0 references
minor-vertices
0 references
number of connected components
0 references