scientific article; zbMATH DE number 1792652

MaRDI QIDQ4552245zbMATH OpenFDO

Authors Dawit Haile

Publication date 29 August 2002

zbMATH Keywords

chromatic indexcritical edge-chromatic graphsVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• New lower bounds on the number of edges of critical graphs
• scientific article; zbMATH DE number 908563
• On the average degree of edge chromatic critical graphs
• On the size of edge-chromatic critical graphs
• A conclusion on the properties of edge-coloring critical graphs

Cited in

(18)

• On the size of edge-chromatic critical graphs
• On the size of edge chromatic critical graphs
• Bounds on the lower size of a 7-critical graph
• Average degrees of edge-chromatic critical graphs
• Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
• On the average degree of edge chromatic critical graphs
• On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs
• On the size of edge chromatic 5-critical graphs
• The average degree of an edge-chromatic critical graph
• A note on the size of edge-chromatic 4-critical graphs
• A conclusion on the properties of edge-coloring critical graphs
• New lower bounds on the number of edges of critical graphs
• scientific article; zbMATH DE number 1186107 (Why is no real title available?)
• Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
• scientific article; zbMATH DE number 908563 (Why is no real title available?)
• Double Vizing fans in critical class two graphs
• Density-sensitive algorithms for (+1)-edge coloring
• Edge-coloring sparse graphs with Colors in quasilinear time

This page was built for publication:

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