Circular permutation graph family with applications

DOI10.1016/0166-218X(92)90012-YzbMath0768.68160OpenAlexW2062685603MaRDI QIDQ1208459

R. D. Lou, Majid Sarrafzadeh

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90012-y

zbMATH Keywords

intersection graphchromatic numberlabeled graphmaximum independent setmaximum cliquerecognition algorithmchain problemcircular permutation diagramcircular permutation graphdominance problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

General circular permutation layout ⋮ Track assignment ⋮ Maximum \(k\)-covering of weighted transitive graphs with applications

Cites Work

• An efficient algorithm for maxdominance, with applications
• On Comparability and Permutation Graphs
• An Optimal Algorithm for the Maximum Two-Chain Problem
• A fast algorithm for computing longest common subsequences
• Circular permutation graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Circular permutation graph family with applications