Hajós' conjecture for line graphs (Q858687): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.03.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2114892226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3853641 / rank | |||
Normal rank | |||
Latest revision as of 12:29, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hajós' conjecture for line graphs |
scientific article |
Statements
Hajós' conjecture for line graphs (English)
0 references
11 January 2007
0 references
G. Hajós conjectured (1961) that if a graph has chromatic number \(k\), then it contains a subdivision of \(K_k\). Counterexamples are known that are line graphs of multigraphs. Here it is proved that if a graph \(X\) without multiple edges has maximum valence \(d\) and edge-chromatic number \(d+1\), then \(X\) has a pair of vertices joined by a \(d\)-set of edge-disjoint paths. Moreover, the line graph of \(X\) satisfies Hajós' conjecture.
0 references
chromatic number
0 references
edge-disjoint paths
0 references
