scientific article; zbMATH DE number 1463393

MaRDI QIDQ4487452zbMATH OpenFDO

Authors João Meidanis, Célia P. de Mello, Celina M. H. de Figueiredo

Publication date 14 March 2002

zbMATH Keywords

chromatic indexedge-coloringneighborhood-overfull graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Publication:4489142
• Edge-colouring graphs with bounded local degree sums
• Recent progress on edge-colouring graphs
• scientific article; zbMATH DE number 19203

Cited in

(13)

• How to find overfull subgraphs in graphs with large maximum degree
• Decompositions for the edge colouring of reduced indifference graphs.
• Graph edge coloring: a survey
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Edge-colouring graphs with bounded local degree sums
• Chromatic index of graphs with no cycle with a unique chord
• scientific article; zbMATH DE number 1472095 (Why is no real title available?)
• scientific article; zbMATH DE number 1512684 (Why is no real title available?)
• Local Algorithms for Edge Colorings in UDGs
• On the maximum number of edges in chordal graphs of bounded degree and matching number
• The overfull conjecture on split-comparability and split-interval graphs
• Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs
• New results on edge-coloring and total-coloring of split graphs

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 Q4487452)