Complementary Graphs and Edge Chromatic Numbers

DOI10.1137/0120020MaRDI QIDQ5621372zbMATH OpenOpenAlexFDO

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

Cited in

(26)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5621372)