A simple nc recognition algorithm for welsh-powell opposition graphs

DOI10.1080/00207169108804025MaRDI QIDQ3989765zbMATHOpenAlexFDO

Authors

Publication date 28 June 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169108804025

zbMATH Keywords

heuristicsparallel algorithmsgraph colouringNC recognition algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Welsh-Powell opposition graphs
• Graph-Theoretic Concepts in Computer Science
• Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs
• Four classes of perfectly orderable graphs
• Characterization and recognition of some opposition and coalition graph classes

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Bounds to Complexities of Networks for Sorting and for Switching
• Welsh-Powell opposition graphs

Cited in

(2)

• Characterization and recognition of some opposition and coalition graph classes
• Welsh-Powell opposition graphs

This page was built for publication: A simple nc recognition algorithm for welsh-powell opposition graphs

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