How to find overfull subgraphs in graphs with large maximum degree. II

zbMath0970.05023MaRDI QIDQ1594580

Thomas Niessen

Publication date: 8 February 2001

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121258

zbMATH Keywords

algorithmregular graphschromatic indexmaximum degreeoverfull graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Edge-colouring of join graphs ⋮ Edge-colouring of joins of regular graphs. I ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Edge-colouring graphs with bounded local degree sums ⋮ Edge coloring graphs with large minimum degree ⋮ On the chromatic index of join graphs and triangle-free graphs with large maximum degree ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time

This page was built for publication: How to find overfull subgraphs in graphs with large maximum degree. II