scientific article; zbMATH DE number 1463393
From MaRDI portal
Publication:4487452
zbMath0981.05045MaRDI QIDQ4487452
Célia Picinin de Mello, João Meidanis, Celina M. Herrera de Figueiredo
Publication date: 14 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
The overfull conjecture on split-comparability and split-interval graphs ⋮ Decompositions for the edge colouring of reduced indifference graphs. ⋮ Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs ⋮ Graph edge coloring: a survey ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ Chromatic index of graphs with no cycle with a unique chord ⋮ On the maximum number of edges in chordal graphs of bounded degree and matching number
This page was built for publication:
