On-line algorithms for ordered sets and comparability graphs

DOI10.1016/0166-218X(94)00062-IMaRDI QIDQ1894374zbMATH OpenFDO

Authors S. G. Penrice

Publication date 24 July 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

on-line algorithmsordered setscomparability graphson-line clique covering

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Combinatorics of partially ordered sets (06A07) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 65699
• On-line algorithms for orders
• Optimal Orientation On-Line
• On-line chain partitions of orders
• On-Line Coloring and Recursive Graph Theory

Cites work

• scientific article; zbMATH DE number 3993569 (Why is no real title available?)
• An Effective Version of Dilworth's Theorem
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Effective coloration
• On-Line Coloring and Recursive Graph Theory
• Transitiv orientierbare Graphen

This page was built for publication: On-line algorithms for ordered sets and comparability graphs

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