On a theorem of Goldberg

DOI10.1002/JGT.20537zbMATH Open1230.05131OpenAlexW2060681913MaRDI QIDQ3174233FDOQ3174233

Authors: J. M. Mcdonald 

Publication date: 12 October 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20537

Recommendations

• On characterizing Vizing's edge colouring bound
• Goldberg's conjecture is true for random multigraphs
• Edge coloring multigraphs without small dense subsets
• scientific article; zbMATH DE number 1560509
• Ring graphs and Goldberg's bound on chromatic index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Achieving maximum chromatic index in multigraphs
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• On the $1.1$ Edge-Coloring of Multigraphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Title not available (Why is that?)
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• Edge-coloring of multigraphs: Recoloring technique
• The chromatic index of multigraphs of order at most 10

Cited In (9)

• The dual of a theorem of Goldman
• A Simple proof of the Goldberg–Straus theorem on numerical radii
• REMARKS ON A GOLDBACH PROPERTY
• Title not available (Why is that?)
• Title not available (Why is that?)
• On characterizing Vizing's edge colouring bound
• Structural properties of edge-chromatic critical multigraphs
• Orientation‐based edge‐colorings and linear arboricity of multigraphs
• Graph edge coloring: a survey

This page was built for publication: On a theorem of Goldberg

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174233)