On-line algorithms for ordered sets and comparability graphs

DOI10.1016/0166-218X(94)00062-IzbMath0829.90147MaRDI QIDQ1894374

S. G. Penrice

Publication date: 24 July 1995

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

zbMATH Keywords

on-line algorithmscomparability graphsordered setson-line clique covering

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• An Effective Version of Dilworth's Theorem
• 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