Welsh-Powell opposition graphs

DOI10.1016/0020-0190(89)90107-5MaRDI QIDQ1115450zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0020-0190(89)90107-5

zbMATH Keywords

recognition algorithmoptimum colouringWelsh-Powell colouring heuristics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A simple nc recognition algorithm for welsh-powell opposition graphs
• Graph-Theoretic Concepts in Computer Science
• Four classes of perfectly orderable graphs
• Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs
• scientific article; zbMATH DE number 4134072

Cites work

• scientific article; zbMATH DE number 3891425 (Why is no real title available?)
• scientific article; zbMATH DE number 3918092 (Why is no real title available?)
• All variations on perfectly orderable graphs
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Four classes of perfectly orderable graphs
• On the semi-perfect elimination

Cited in

(6)

• Some aspects of the semi-perfect elimination
• A simple nc recognition algorithm for welsh-powell opposition graphs
• An nc algorithm to recognize hhd-free graphs
• On the complexity of distributed graph coloring with local minimality constraints
• Characterization and recognition of some opposition and coalition graph classes
• Recognition of some perfectly orderable graph classes

This page was built for publication: Welsh-Powell opposition graphs

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