Complementary Graphs and Edge Chromatic Numbers

DOI10.1137/0120020zbMath0217.30904OpenAlexW2028995527MaRDI QIDQ5621372

Yousef Alavi, Mehdi Behzad

Publication date: 1971

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0120020

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (26)

Behzad-Vizing conjecture and Cartesian-product graphs ⋮ Some parameters of graph and its complement ⋮ Generalization of two results of Hilton on total-colourings of a graph ⋮ The achromatic indices of the regular complete multipartite graphs ⋮ The total graph of a hypergraph ⋮ Total chromatic number of regular graphs of odd order and high degree ⋮ On upper bounds for the pseudo-achromatic index ⋮ Extending fixed vertex-colourings to total colourings ⋮ New Nordhaus-Gaddum-type results for the Kirchhoff index ⋮ The total chromatic number of nearly complete bipartite graphs ⋮ The total chromatic number of graphs having large maximum degree ⋮ Recent results on the total chromatic number ⋮ An upper bound for total colouring of graphs ⋮ Chromatic numbers of infinite graphs ⋮ Graph theory ⋮ The total coloring of a multigraph with maximal degree 4 ⋮ Graphs with forbidden subgraphs ⋮ The Hall number, the Hall index, and the total Hall number of a graph ⋮ A new upper bound for total colourings of graphs ⋮ Total colorings of equibipartite graphs ⋮ A study of the total chromatic number of equibipartite graphs ⋮ Graph factorization and theorems of the Nordhaus-Gaddum class ⋮ Relations between parameters of a graph ⋮ Total colouring regular bipartite graphs is NP-hard ⋮ The total chromatic number of regular graphs whose complement is bipartite ⋮ Recent developments in total colouring

This page was built for publication: Complementary Graphs and Edge Chromatic Numbers