A simple nc recognition algorithm for welsh-powell opposition graphs

DOI10.1080/00207169108804025zbMATH Open0742.68049OpenAlexW1996736446MaRDI QIDQ3989765FDOQ3989765

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

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

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)

Cites Work

• Title not available (Why is that?)
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Welsh-Powell opposition graphs
• Bounds to Complexities of Networks for Sorting and for Switching

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)