The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 (Q5232150): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1703.00959 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Colouring the petals of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subcubic Edge‐Chromatic Critical Graphs Have Many Edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the chromatic index of almost all graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Méthode et théorème général de coloration des aretes d'un multigraphe / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The chromatic index of a graph whose core has maximum degree two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4892326 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3118960 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2959787790 / rank | |||
Normal rank | |||
Latest revision as of 09:39, 30 July 2024
scientific article; zbMATH DE number 7099872
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 |
scientific article; zbMATH DE number 7099872 |
Statements
The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 (English)
0 references
29 August 2019
0 references
edge-coloring
0 references
overfull graph
0 references
class 1
0 references
Hilton-Zhao conjecture
0 references
