𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On chordal proper circular arc graphs

✍ Scribed by Jørgen Bang-Jensen; Pavol Hell

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
206 KB
Volume
128
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Well covered simplicial, chordal, and ci
Well covered simplicial, chordal, and circular arc graphs
✍ Prisner, Erich; Topp, Jerzy; Vestergaard, Preben Dahl 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB 👁 2 views

A graph G is called well covered if every two maximal independent sets of G have the same number of vertices. In this paper, we,characterize well covered simplicial, chordal and circular arc graphs.

A relationship between triangulated grap
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
✍ Dale J. Skrien 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in

Lexicographic orientation and representa
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
✍ Pavon Hell; Jing Huang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 823 KB

## Abstract We introduce a simple new technique which allows us to solve several problems that can be formulated as seeking a suitable orientation of a given undirected graph. In particular, we use this technique to recognize and transitively orient comparability graphs, to recognize and represent

The round-up property of the fractional
The round-up property of the fractional chromatic number for proper circular arc graphs
✍ Niessen, Thomas; Kind, Jaakob 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 2 views

Let G = (V, E) be a graph and let k be a nonnegative integer. A vector c ∈ Z V + is called k-colorable iff there exists a coloring of G with k colors that assigns exactly c(v) colors to vertex v ∈ V . Denote by χ(G) and χ f (G) the chromatic number and fractional chromatic number, respectively. We p