Hamiltonicity of edge-chromatic critical graphs (Q2182200): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hamiltonicity of edge-chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average degree of an edge‐chromatic critical graph II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank
 
Normal rank

Latest revision as of 18:34, 22 July 2024

scientific article; zbMATH DE number 6775855
  • Hamiltonicity of edge chromatic critical graphs
Language Label Description Also known as
English
Hamiltonicity of edge-chromatic critical graphs
scientific article; zbMATH DE number 6775855
  • Hamiltonicity of edge chromatic critical graphs

Statements

Hamiltonicity of edge-chromatic critical graphs (English)
0 references
Hamiltonicity of edge chromatic critical graphs (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
21 May 2020
0 references
18 September 2017
0 references
0 references
0 references
edge-\(k\)-coloring
0 references
edge-critical graphs
0 references
Hamiltonicity
0 references
edge coloring
0 references
critical graphs
0 references
Hamiltonian cycles
0 references
0 references
0 references
0 references