𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Structural results on circular-arc graphs and circle graphs: A survey and the main open problems

✍ Scribed by Durán, Guillermo; Grippo, Luciano N.; Safe, Martín D.

Book ID
122506438
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
615 KB
Volume
164
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The end structure of a graph: recent res
The end structure of a graph: recent results and open problems
✍ Reinhard Diestel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1022 KB

This paper aims to give a brief introduction to a set of problems, old and new, concerned with one of the main and long-standing quests in infinite graph theory: how to represent the end structure of a given graph by that of a simpler subgraph, in particular a spanning tree. There has been a fair am

Solving the all-pair shortest path query
Solving the all-pair shortest path query problem on interval and circular-arc graphs
✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently

On the Ramsey multiplicities of graphs—p
On the Ramsey multiplicities of graphs—problems and recent results
✍ Stefan A. Burr; Vera Rosta 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

## Abstract Ramsey's theorem guarantees that if __G__ is a graph, then any 2‐coloring of the edges of a large enough complete graph yields a monochromatic copy of __G__. Interesting problems arise when one asks how many such __G__ must occur. A survey of this and related problems is given, along wi