Total-chromatic number and chromatic index of dually chordal graphs

DOI10.1016/S0020-0190(99)00050-2zbMath1339.05151MaRDI QIDQ294687

João Meidanis, Célia Picinin de Mello, Celina M. Herrera de Figueiredo

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000502?np=y

zbMATH Keywords

edge coloringgraph algorithmschordal graphstotal coloringclique graphsmaximum neighborhood ordering

Mathematics Subject Classification ID

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

Related Items

The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal ⋮ Even-power of cycles with many vertices are type 1 total colorable ⋮ Total coloring of claw-free planar graphs ⋮ A result on the total colouring of powers of cycles ⋮ AVD-edge coloring on powers of paths ⋮ Edge-colouring and total-colouring chordless graphs ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Edge-colouring graphs with bounded local degree sums ⋮ The overfull conjecture on split-comparability and split-interval graphs ⋮ Decompositions for the edge colouring of reduced indifference graphs. ⋮ Total colorings-a survey ⋮ The total chromatic number of split-indifference graphs ⋮ Total coloring of rooted path graphs ⋮ Total chromatic number of unichord-free graphs ⋮ A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs ⋮ On the total and AVD-total coloring of graphs ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs