Graphclass: chordal ∩ unit circular arc

The speed of a class $X$ is the function $n \mapsto |X_n|,ドル where $X_n$ is the set of $n$-vertex labeled graphs in $X$.

Depending on the rate of growths of the speed of the class, ISGCI distinguishes the following values of the parameter:
Constant
Polynomial
Exponential
Factorial
Superfactorial (2ドル^{o(n^2)}$ )
Superfactorial (2ドル^{\Theta(n^2)}$ )

J.P. Spinrad
Efficient graph representations
American Mathematical Society, Fields Institute Monograph Series 19 (2003)

V.V. Lozin, C. Mayhill, V. Zamaraev
Locally bounded coverings and factorial properties of graphs
European J. Combin. 33 No.4 534-543 (2012)

(no preview available)

The acyclic chromatic number of a graph $G$ is the smallest size of a vertex partition $\{V_1,\dots,V_l\}$ such that each $V_i$ is an independent set and for all $i,j$ that graph $G[V_i\cup V_j]$ does not contain a cycle.

The bandwidth of a graph $G$ is the shortest maximum "length" of an edge over all one dimensional layouts of $G$. Formally, bandwidth is defined as $\min_{i \colon V \rightarrow \mathbb{N}\;}\{\max_{\{u,v\}\in E\;} \{|i(u)-i(v)|\}\mid i\text{ is injective}\}$.

A book embedding of a graph $G$ is an embedding of $G$ on a collection of half-planes (called pages) having the same line (called spine) as their boundary, such that the vertices all lie on the spine and there are no crossing edges. The book thickness of a graph $G$ is the smallest number of pages over all book embeddings of $G$.

F. Bernhart, P.C. Kainen
The book thickness of a graph
J. of Combin. Th. (B) 27 320-331 (1979)

Consider the following decomposition of a graph $G$ which is defined as a pair $(T,L)$ where $T$ is a binary tree and $L$ is a bijection from $V(G)$ to the leaves of the tree $T$. The function $\text{cut-bool} \colon 2^{V(G)} \rightarrow R$ is defined as $\text{cut-bool}(A)$ := $\log_2|\{S \subseteq V(G) \backslash A \mid \exists X \subseteq A \colon S = (V(G) \backslash A) \cap \bigcup_{x \in X} N(x)\}|$. Every edge $e$ in $T$ partitions the vertices $V(G)$ into $\{A_e,\overline{A_e}\}$ according to the leaves of the two connected components of $T - e$. The booleanwidth of the above decomposition $(T,L)$ is $\max_{e \in E(T)\;} \{ \text{cut-bool}(A_e)\}$. The booleanwidth of a graph $G$ is the minimum booleanwidth of a decomposition of $G$ as above.

A branch decomposition of a graph $G$ is a pair $(T,\chi),ドル where $T$ is a binary tree and $\chi$ is a bijection, mapping leaves of $T$ to edges of $G$. Any edge $\{u, v\}$ of the tree divides the tree into two components and divides the set of edges of $G$ into two parts $X, E \backslash X,ドル consisting of edges mapped to the leaves of each component. The width of the edge $\{u,v\}$ is the number of vertices of $G$ that is incident both with an edge in $X$ and with an edge in $E \backslash X$. The width of the decomposition $(T,\chi)$ is the maximum width of its edges. The branchwidth of the graph $G$ is the minimum width over all branch-decompositions of $G$.

Consider a decomposition $(T,\chi)$ of a graph $G$ where $T$ is a binary tree with $|V(G)|$ leaves and $\chi$ is a bijection mapping the leaves of $T$ to the vertices of $G$. Every edge $e \in E(T)$ of the tree $T$ partitions the vertices of the graph $G$ into two parts $V_e$ and $V \backslash V_e$ according to the leaves of the two connected components in $T - e$. The width of an edge $e$ of the tree is the number of edges of a graph $G$ that have exactly one endpoint in $V_e$ and another endpoint in $V \backslash V_e$. The width of the decomposition $(T,\chi)$ is the largest width over all edges of the tree $T$. The carvingwidth of a graph is the minimum width over all decompositions as above.

The chromatic number of a graph is the minimum number of colours needed to label all its vertices in such a way that no two vertices with the same color are adjacent.

The cliquewidth of a graph is the number of different labels that is needed to construct the graph using the following operations:

• creation of a vertex with label $i,ドル
• disjoint union,
• renaming labels $i$ to label $j,ドル and
• connecting all vertices with label $i$ to all vertices with label $j$.

Golumbic, Martin Charles; Rotics, Udi
On the clique-width of perfect graph classes (extended abstract) .
Graph theoretic concepts in computer science. 25th international workshop, WG '99 Ascona, Switzerland, June 17-19, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1665, 135-147 (1999)

The cochromatic number of a graph $G$ is the minimum number of colours needed to label all its vertices in such a way that that every set of vertices with the same colour is either independent in G, or independent in $\overline{G}$.

(no preview available)

The cutwidth of a graph $G$ is the smallest integer $k$ such that the vertices of $G$ can be arranged in a linear layout $v_1, \ldots, v_n$ in such a way that for every $i = 1, \ldots,n - 1,ドル there are at most $k$ edges with one endpoint in $\{v_1, \ldots, v_i\}$ and the other in $\{v_{i+1}, \ldots, v_n\}$.

Let $G$ be a graph and consider the following algorithm:

• Find a vertex $v$ with smallest degree.
• Delete vertex $v$ and its incident edges.
• Repeat as long as the graph is not empty.

The degeneracy of a graph $G$ is the maximum degree of a vertex when it is deleted in the above algorithm.

The diameter of a graph $G$ is the length of the longest shortest path between any two vertices in $G$.

The distance to block of a graph $G$ is the size of a smallest vertex subset whose deletion makes $G$ a block graph.

Let $G$ be a graph. Its distance to clique is the minimum number of vertices that have to be deleted from $G$ in order to obtain a clique.

A cluster is a disjoint union of cliques. The distance to cluster of a graph $G$ is the size of a smallest vertex subset whose deletion makes $G$ a cluster graph.

The distance to co-cluster of a graph is the minimum number of vertices that have to be deleted to obtain a co-cluster graph.

The distance to cograph of a graph $G$ is the minimum number of vertices that have to be deleted from $G$ in order to obtain a cograph .

The distance to linear forest of a graph $G = (V, E)$ is the size of a smallest subset $S$ of vertices, such that $G[V \backslash S]$ is a disjoint union of paths and singleton vertices.

The distance to outerplanar of a graph $G = (V,E)$ is the minumum size of a vertex subset $X \subseteq V,ドル such that $G[V \backslash X]$ is a outerplanar graph.

The genus $g$ of a graph $G$ is the minimum number of handles over all surfaces on which $G$ can be embedded without edge crossings.

The max-leaf number of a graph $G$ is the maximum number of leaves in a spanning tree of $G$.

The parameter maximum clique of a graph $G$ is the largest number of vertices in a complete subgraph of $G$.

The maximum degree of a graph $G$ is the largest number of neighbors of a vertex in $G$.

An independent set of a graph $G$ is a subset of pairwise non-adjacent vertices. The parameter maximum independent set of graph $G$ is the size of a largest independent set in $G$.

For a graph $G = (V,E)$ an induced matching is an edge subset $M \subseteq E$ that satisfies the following two conditions: $M$ is a matching of the graph $G$ and there is no edge in $E \backslash M$ connecting any two vertices belonging to edges of the matching $M$. The parameter maximum induced matching of a graph $G$ is the largest size of an induced matching in $G$.

A matching in a graph is a subset of pairwise disjoint edges (any two edges that do not share an endpoint). The parameter maximum matching of a graph $G$ is the largest size of a matching in $G$.

A clique cover of a graph $G = (V, E)$ is a partition $P$ of $V$ such that each part in $P$ induces a clique in $G$. The minimum clique cover of $G$ is the minimum number of parts in a clique cover of $G$. Note that the clique cover number of a graph is exactly the chromatic number of its complement.

A dominating set of a graph $G$ is a subset $D$ of its vertices, such that every vertex not in $D$ is adjacent to at least one member of $D$. The parameter minimum dominating set for graph $G$ is the minimum number of vertices in a dominating set for $G$.

A path decomposition of a graph $G$ is a pair $(P,X)$ where $P$ is a path with vertex set $\{1, \ldots, q\},ドル and $X = \{X_1,X_2, \ldots ,X_q\}$ is a family of vertex subsets of $V(G)$ such that:

• $\bigcup_{p \in \{1,\ldots ,q\}} X_p = V(G)$
• $\forall\{u,v\} \in E(G) \exists p \colon u, v \in X_p$
• $\forall v \in V(G)$ the set of vertices $\{p \mid v \in X_p\}$ is a connected subpath of $P$.

The width of a path decomposition $(P,X)$ is max$\{|X_p| - 1 \mid p \in \{1,\ldots ,q\}\}$. The pathwidth of a graph $G$ is the minimum width among all possible path decompositions of $G$.

Let $M$ be the $|V| \times |V|$ adjacency matrix of a graph $G$. The cut rank of a set $A \subseteq V(G)$ is the rank of the submatrix of $M$ induced by the rows of $A$ and the columns of $V(G) \backslash A$. A rank decomposition of a graph $G$ is a pair $(T,L)$ where $T$ is a binary tree and $L$ is a bijection from $V(G)$ to the leaves of the tree $T$. Any edge $e$ in the tree $T$ splits $V(G)$ into two parts $A_e, B_e$ corresponding to the leaves of the two connected components of $T - e$. The width of an edge $e \in E(T)$ is the cutrank of $A_e$. The width of the rank-decomposition $(T,L)$ is the maximum width of an edge in $T$. The rankwidth of the graph $G$ is the minimum width of a rank-decomposition of $G$.

A tree depth decomposition of a graph $G = (V,E)$ is a rooted tree $T$ with the same vertices $V,ドル such that, for every edge $\{u,v\} \in E,ドル either $u$ is an ancestor of $v$ or $v$ is an ancestor of $u$ in the tree $T$. The depth of $T$ is the maximum number of vertices on a path from the root to any leaf. The tree depth of a graph $G$ is the minimum depth among all tree depth decompositions.

A tree decomposition of a graph $G$ is a pair $(T, X),ドル where $T = (I, F)$ is a tree, and $X = \{X_i \mid i \in I\}$ is a family of subsets of $V(G)$ such that

• the union of all $X_i,ドル $i \in I$ equals $V,ドル
• for all edges $\{v,w\} \in E,ドル there exists $i \in I,ドル such that $v, w \in X_i,ドル and
• for all $v \in V$ the set of nodes $\{i \in I \mid v \in X_i\}$ forms a subtree of $T$.

The width of the tree decomposition is $\max |X_i| - 1$.
The treewidth of a graph is the minimum width over all possible tree decompositions of the graph.

Let $G$ be a graph. Its vertex cover number is the minimum number of vertices that have to be deleted in order to obtain an independent set.

P. Heggernes, D. Lokshtanov, R. Mihai, C. Papadopoulos
Cutwidth of split graphs, threshold graphs, and proper interval graphs
Proceedings of WG 2008, LNCS 5344, pp. 218-229 (2008)

J. Yuan, S. Zhou
Optimal labelling of unit interval graphs
Appl. Math. J. Chinese Univ. Ser. B (English edition) 10 337-344 (1995)

H.J. Broersma, E. Dahlhaus, T. Kloks
Algorithms for the treewidth and minimum fill-in of HHD-free graphs
23rd Intern. Workshop on Graph--Theoretic Concepts in Comp. Sci. WG'97, Lecture Notes in Comp. Sci. 1335 (1997) 109-117

H.L. Bodlaender
A tourist guide through treewidth
Acta Cybernetica 11 1993 1--23

H.L. Bodlaender
A tourist guide through treewidth
Acta Cybernetica 11 1993 1--23

H.L. Bodlaender
A tourist guide through treewidth
Acta Cybernetica 11 1993 1--23

T. Kloks, D. Kratsch, J. Spinrad
On treewidth and minimum fill--in of asteroidal triple--free graphs
Theor. Comp. Sci. 175 1997 309--335

T. Kloks, D. Kratsch, J. Spinrad
On treewidth and minimum fill--in of asteroidal triple--free graphs
Theor. Comp. Sci. 175 1997 309--335

H.L. Bodlaender
A tourist guide through treewidth
Acta Cybernetica 11 1993 1--23

H.L. Bodlaender, T. Kloks, D. Kratsch, H. Mueller
Treewidth and minimum fill-in on d-trapezoid graphs
J. Graph Algorithms Appl. 2 1-23 (1998)

E. Dahlhaus
Minimum fill-in and treewidth on graphs modularly decomposable into chordal graphs
24th Intern. Workshop on Graph--Theoretic Concepts in Comp. Sci. WG'98, Lecture Notes in Comp. Sci. 1517 (1998) 351-358

V. Bouchitte, I. Todinca
Treewidth and minimum fill-in of weakly triangulated graphs
Annual symposium on theoretical aspects of computer science STACS 99, Lecture Notes in Comp. Sci. 1563 (1999) 197-206

A. Leitert
3-Colourability of dually chordal graphs in linear time
Manuscript, 2012

J. Stacho
3-colouring of AT-free graphs in polynomial time
21st International Symposium on Algorithms and Computation ISAAC, Lecture Notes in Comp. Sci. LNCS 6507 144-155 (2010)

M. Kaminski, V. Lozin
Vertex 3-colorability of claw-free graphs
Algorithmic Operations Research Vol.2 15-21 (2007)

M.R. Garey, D.S. Johnson, G.L. Miller, C.H. Papadimitriou
The complexity of coloring circular arcs and chords
SIAM J. on Algebraic and Discrete Methods 1 No.2 216-227 (1980)

(no preview available)

M.C. Francis, D. Goncalves, P. Ochem
The maximum clique problem in multiple interval graphs
Proceedings of WG 2012, Lecture Notes in Computer Science 7551, 57-68 (2012)

F. Koenig
Sorting with objectives
Ph.D. thesis, Technische Universitaet Berlin (2009)

Eschen, Elaine M.; Hoàng, Chính T.; Petrick, Mark D.T.; Sritharan, R
Disjoint clique cutsets in graphs without long holes
J. Graph Theory 48, No.4, 277-298 (2005)

H. Imai, T. Asano
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
J. Algorithms 4 1983 310--323

A. Tiskin
Fast distance multiplication of unit-Monge matrices
Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1287-1296 (2010)

A. Pecher, A.K. Wagler
Clique and chromatic number of circular-perfect graphs
Proceedings of ISCO 2010 - International Symposium on Combinatorial Optimization, Elec. Notes in Discrete Math 36 199-206 (2010)

Hsu, Wen-Lian; Tsai, Kuo-Hui
Linear time algorithms on circular-arc graphs.
Inf. Process. Lett. 40, No.3, 123-129 (1991)

M.C. Golumbic
Algorithmic Graph Theory and Perfect Graphs
Academic Press, New York 1980

F. Gavril
Intersection graphs of Helly families of subtrees
Discrete Appl. Math. 66 1996 45--56

S.E. Markosjan, G.S. Gasparian, B. Reed
$\beta$--perfect graphs
J. Comb. Theory (B) 67 1996 1--11

Eschen, Elaine M.; Hoàng, Chính T.; Petrick, Mark D.T.; Sritharan, R
Disjoint clique cutsets in graphs without long holes
J. Graph Theory 48, No.4, 277-298 (2005)

C.T. Hoang
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Discrete Appl. Math. 55 133-143 (1994)

F. Gavril
Intersection graphs of Helly families of subtrees
Discrete Appl. Math. 66 1996 45--56

A. Pecher, A.K. Wagler
Clique and chromatic number of circular-perfect graphs
Proceedings of ISCO 2010 - International Symposium on Combinatorial Optimization, Elec. Notes in Discrete Math 36 199-206 (2010)

C.T. Hoang
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Discrete Appl. Math. 55 133-143 (1994)

M.C. Golumbic
The complexity of comparability graph recognition and coloring
Computing 18 1977 199--208

G.B. Mertzios
An intersection model for multitolerance graphs: Efficient algorithms and hierarchy
Proc. of 21 annual ACM-SIAM symposium on Discrete algorithms SODA2011 1306-1317 (2011)

M. Gr\"otschel, L. Lov\'asz, A. Schrijver
The ellipsoid method and its consequences in combinatorial optimization
Combinatorica 1 169--197, 1981 Corrigendum

B. Bhattacharya, P. Hell, J. Huang
A linear algorithm for maximum weight cliques in proper circular arc graphs
SIAM J. Discrete Math. 9 No. 2 274-289 (1996)

R.B. Hayward, C. Ho\`ang, F. Maffray
Optimizing weakly triangulated graphs
Graphs and Combinatorics 5 339--349, Erratum: 6 (1990) 33--35 1989

M.S. Chang
Efficient algorithms for the domination problems on interval and circular-arc graphs.
SIAM J. Comput. 27, No.6, 1671-1694 (1998)

Hsu, Wen-Lian; Tsai, Kuo-Hui
Linear time algorithms on circular-arc graphs.
Inf. Process. Lett. 40, No.3, 123-129 (1991)

A. Brandst\"adt, V.D. Chepoi, F.F. Dragan
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Discrete Appl. Math. 82 43--77 1998

F.F. Dragan, C.F. Prisacaru, V.D. Chepoi
Location problems in graphs and the Helly property (in Russian) (1987)
(appeared partially in Diskretnaja Matematika 4 67--73) 1992

M.S. Chang
Efficient algorithms for the domination problems on interval and circular-arc graphs.
SIAM J. Comput. 27, No.6, 1671-1694 (1998)

D. Kratsch
Domination and total domination in asteroidal triple-free graphs
Discrete Appl. Math. 99 No.1-3, 111-123 (2000)

A. Brandstaedt, F. Dragan
On linear and circular structure of (claw, net)-free graph
To appear in Discrete Appl. Math.

D. Kratsch, L. Stewart
Domination on cocomparability graphs
SIAM J. Discrete Math. 6(3) (1993) 400-417

H. Breu, D.G. Kirkpatrick
Algorithms for the dominating set and Steiner set problems in cocomparability graphs
Manuscript 1993

T.W. Haynes, S.T. Hedetniemi, P.J. Slater (eds.)
Fundamentals of Domination in Graphs
Marcel Dekker, New York, Basel , Vol. 208 1998

T. Kloks, C.-S. Liu, S.-L. Peng
Domination and independent domination on probe interval graphs
Proceedings of 23rd Workshop on Combinatorial Mathematics and Computation Theory 93-97 (2006)

M. Farber
Domination, independent domination, and duality in strongly chordal graphs.
Discrete Appl. Math. 7 1984 115--130

Liang, Y. Daniel
Dominations in trapezoid graphs.
Inf. Process. Lett. 52, No.6, 309-315 (1994)

Feedback vertex set on AT-free graphs
D. Kratsch, H. Mueller, I. Todinca
Discrete Appl. Math. 156 No. 10 1936-1947 (2008)

P. Festa, P.M. Pardalos, M.G.C. Resende
Feedback set problems
in: D.Z. Du, P.M. Pardalos, Handbook of Combinatorial Optimization, Supplement vol. A, Kluwer Academic Publishers, 209-259 (2000)

J.P. Spinrad
Efficient graph representations
American Mathematical Society, Fields Institute Monograph Series 19 (2003)

M.S Chang, Y.D. Liang
Minimum feedback vertex set in cocomparability graphs and convex bipartite graphs
Acta Informatica 34 337-346 (1997)

S.R. Coorg, C.P. Rangan
Feedback vertex set on cocomparability graphs
Networks 26 101-111 (1995)

P. Festa, P.M. Pardalos, M.G.C. Resende
Feedback set problems
in: D.Z. Du, P.M. Pardalos, Handbook of Combinatorial Optimization, Supplement vol. A, Kluwer Academic Publishers, 209-259 (2000)

Y.D. Liang
On the feedback vertex set problem in permutation graphs
Information Proc. Lett. 52 123-129 (1994)

A.R. Curtis, M.C. Lin, R.M. McConnell, Y. Nussbaum, F.J. Soulignac, J.P. Spinrad, J.L. Szwarcfiter
Isomorphism of graph classes related to the circular-ones property
DMTCS 15 No. 1 157-182 (2013)

A.R. Curtis, M.C. Lin, R.M. McConnell, Y. Nussbaum, F.J. Soulignac, J.P. Spinrad, J.L. Szwarcfiter
Isomorphism of graph classes related to the circular-ones property
DMTCS 15 No. 1 157-182 (2013)

K.S. Booth, G.S. Lueker
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms.
J. Comput. Syst. Sci. 13, 335-379 (1976). [ISSN 0022-0000]

M.C. Lin, F. Soulignac, J.L. Szwarcfiter
A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs
LNCS 5124 355-366 (2008)

A.R. Curtis, M.C. Lin, R.M. McConnell, Y. Nussbaum, F.J. Soulignac, J.P. Spinrad, J.L. Szwarcfiter
Isomorphism of graph classes related to the circular-ones property
DMTCS 15 No. 1 157-182 (2013)

Ch. Paul, E. Protopapas
Tree-layout based graph classes: proper chordal graphs
International Symposioum on Theoretical Aspects of Computer Science STACS 2024, LIPIcs 289 No.55 1-18 (2024)

S. Chaplick
Intersection graphs of non-crossing paths
Discrete Math. 346 No.8 (2023)

A. Brandstaedt, F.F. Dragan, E. Koehler
Linear time algorithms for the Hamiltonian problems on (claw,net)-free graphs
SIAM J. Computing 30 1662-1677 (2000)

J.M. Keil
Finding hamiltonian circuits in interval graphs
Information Proc. Lett. 20 201-206 (1985)

L. Ibarra
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Proc. Lett. 109 Issue 18 1105-1108 (2009)

B.S. Panda, S.K. Das
A linear time recognition algorithm for proper interval graphs
Information Proc. Lett. 87 153-161 (2003)

R.-W. Hung, M.-S. Chang, C.-H. Laio
The Hamiltonian cycle problem on circular-arc graphs
Proc. of the International MultiConference of Engineers and Computer Scientists IMECS 2009

W.K. Shih, T.C. Chen, W.L. Hsu
An O(n^2 log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs
SIAM J. Comput. 21 No.6 1026-1046 (1992)

D. Duffus, R.J. Gould, M.S. Jacobson
Forbidden subgraphs and the Hamiltonian theme.
The theory and applications of graphs, 4th int. Conf., Kalamazoo/Mich. 1980, 297-316 (1981).

J.S. Deogun, G. Steiner
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
SIAM J. Computing 23 Issue 3 520-552 (1994)

S. Chaplick
Intersection graphs of non-crossing paths
Discrete Math. 346 No.8 (2023)

A. Brandstaedt, F.F. Dragan, E. Koehler
Linear time algorithms for the Hamiltonian problems on (claw,net)-free graphs
SIAM J. Computing 30 1662-1677 (2000)

G.B. Mertzios, I. Bezakova
Computing and counting longest paths on circular-arc graphs in polynomial time
Discrete Appl. Math, in press

D. Duffus, R.J. Gould, M.S. Jacobson
Forbidden subgraphs and the Hamiltonian theme.
The theory and applications of graphs, 4th int. Conf., Kalamazoo/Mich. 1980, 297-316 (1981).

J.S. Deogun, G. Steiner
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
SIAM J. Computing 23 Issue 3 520-552 (1994)

M. Farber
Independent domination in chordal graphs
Operations Research Lett. 1 No.4 134-138 (1982)

F. Gavril
The intersection graphs of subtrees in trees are exactly the chordal graphs
J. Comb. Theory (B) 16 1974 47--56

D.J. Rose, R.E. Tarjan, G.S. Lueker
Algorithmic aspects of vertex elimination on graph
SIAM J. Computing 5 1976 266--283

M.C. Golumbic, P.L Hammer
Stability in circular arc graphs.
J. Algorithms 9 (1988) 56-63

W.L. Hsu, J.P. Spinrad
Independent sets in circular arc graphs
J. Algorithms 19 (1995) 145-160

Hsu, Wen-Lian; Tsai, Kuo-Hui
Linear time algorithms on circular-arc graphs.
Inf. Process. Lett. 40, No.3, 123-129 (1991)

R.M. McConnell, J.P. Spinrad
Modular decomposition and transitive orientation
Discrete Math. 201 (1999) 189-241

M.U. Gerber, V.V. Lozin
Robust algorithms for the stable set problem
Graphs and Combin., to appear

R.E. Tarjan
Decomposition by clique separators
Discrete Math. 55 1985 221--232

(no preview available)

S.H. Whitesides
A method for solving certain graph recognition and optimization problems, with applications to perfect graphs
Annals of Discrete Math. 21 1984 281--297

M. Burlet, J. Fonlupt
Polynomial algorithm to recognize a Meyniel graph
Annals of Discrete Math. 21 1984 225--252

M.U. Gerber, V.V. Lozin
Robust algorithms for the stable set problem
Graphs and Combin., to appear

V.L. Lozin, M. Milanic
On finding augmenting graphs
Rutcor Research Report 28-2005

N. Nash, D. Gregg
An output sensitive algorithm for computing a maximum independent set of a circle graph
Inform. Process. Lett. 110 No.16 630-634 (2010)

A. Brandstaedt, F. Dragan
On linear and circular structure of (claw, net)-free graph
To appear in Discrete Appl. Math.

P.L. Hammer, N.V.R. Mahadev, D. de Werra
The struction of a graph: application to CN--free graphs
Combinatorica 5 1985 141--147

N. Sbihi
Algorithme de recherche d'un stable de cardinalit\'e maximum dans un graphe sans \'etoile
Discrete Math. 29 1980 53--76

S.H. Whitesides
A method for solving certain graph recognition and optimization problems, with applications to perfect graphs
Annals of Discrete Math. 21 1984 281--297

Eschen, Elaine M.; Hoàng, Chính T.; Petrick, Mark D.T.; Sritharan, R
Disjoint clique cutsets in graphs without long holes
J. Graph Theory 48, No.4, 277-298 (2005)

R. Hayward, J. Spinrad. R. Sritharan
Weakly chordal graph algorithms via handles
Proc. of the 11th symposium on Discrete Algorithms 42-49, 2000

R.B. Hayward, C. Ho\`ang, F. Maffray
Optimizing weakly triangulated graphs
Graphs and Combinatorics 5 339--349, Erratum: 6 (1990) 33--35 1989

(decision variant)

A. Boyacı, T. Ekim, M. Shalom
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
Information Proc. Letters 121 29-33 (2017)

T. Ekim, P. Hell, J. Stacho, D. de Werra
Polarity of chordal graphs
Discrete Applied Mathematics 156 No. 13 2469-2479 (2008)

V.B. Le, R. Nevries
Complexity and algorithms for recognizing polar and monopolar graphs
Theoretical Computer Science 528 1-11 (2014)

R. Churchley, J. Huang
On the polarity and monopolarity of graphs
J. Graph Theory 76 No. 2 1138-148 (2014)

V.B. Le, R. Nevries
Complexity and algorithms for recognizing polar and monopolar graphs
Theoretical Computer Science 528 1-11 (2014)

T. Ekim, P. Hell, J. Stacho, D. de Werra
Polarity of chordal graphs
Discrete Applied Mathematics 156 No. 13 2469-2479 (2008)

J.M. Keil
Finding hamiltonian circuits in interval graphs
Information Proc. Lett. 20 201-206 (1985)

D.G. Corneil, P.A. Kamula
Extensions of permutation and interval graphs
Proceedings 18th South--Eastern Conf. on Combinatorics, Graph Theory and Computing ,Congressus Numerantium 58 (1987) 1987 267--275

C. de Figueiredo, J. Meidanis, C.P. de Mello
A linear time algorithm for proper interval graph recognition
Inf. Proc. Letters 56 1995 179--184

X. Deng, P. Hell, J. Huang
Linear time representation algorithms for proper circular arc graphs and proper interval graphs
SIAM J. Computing 25 1996 390--403

B. Bhattacharya, P. Hell, J. Huang
A linear algorithm for maximum weight cliques in proper circular arc graphs
SIAM J. Discrete Math. 9 No. 2 274-289 (1996)

M.V. da Silva, K. Vuskovic
Triangulated neighborhoods in even-hole-free graphs
Discrete Math. 307 1065-1073 (2007)

M.M. Halldorson, S. Kitaev, A. Pyatkin
Alternation graphs
Proceedings of WG 2011, Lecture Notes in Computer Science 6986, 191-202 (2011)

W.-L. Hsu
Maximum weight clique algorithms for circular-arc graphs and circle graphs
SIAM J. Computing 14 No.1 224-231 (1985)

W.-L. Hsu
Maximum weight clique algorithms for circular-arc graphs and circle graphs
SIAM J. Computing 14 No.1 224-231 (1985)

M.C. Golumbic
Algorithmic Graph Theory and Perfect Graphs
Academic Press, New York 1980

F. Gavril
Maximum weight independent sets and cliques in intersection graphs of filaments.
Information Processing Letters 73(5-6) 181-188 (2000)

M. Kaufmann, J. Kratochvil, K.A. Lehmann, A.R. Subramanian
Max-tolerance graphs as intersection graphs: cliques, cycles and recognition
Proc. of 17th annual ACM-SIAM symposium on Discrete algorithms SODA'06 832-841 (2006)

(no preview available)

F. Maffray, M. Preissmann
Split--neighbourhood graphs and the strong perfect graph conjecture
J. Comb. Theory (B) 63 1995 294--309

C.L. Lu, C.Y. Tang
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
Information Proc. Lett. 61 107-111 (1997)

F. Gavril
Minimum weight feedback vertex sets in circle graphs
Information Proc. Lett. 107 No.1 1-6 (2008)

M. Farber
Domination, independent domination, and duality in strongly chordal graphs.
Discrete Appl. Math. 7 1984 115--130

H. Hempel, D. Kratsch
On claw-free asteroidal triple-free graphs
Discrete Appl. Math. 121, No.1-3, 155-180 (2002)

A. Frank
Some polynomial algorithms for certain graphs and hypergraphs.
Proc. 5th Br. comb. Conf., Aberdeen 1975, Congr. Numer. XV, 211-226 (1976).

H. Broersma, T. Kloks, D. Kratsch, H. M\"uller
Independent sets in asteroidal triple-free graphs
SIAM J. Discrete Math. 12, No.2, 276-287 (1999)

V.E. Alekseev
On the local restrictions effect on the complexity of finding the graph independence number
Combinatorial-algebraic methods in applied mathematics Gorkiy Univ. Press, Gorkiy (1983) 3-13 (in Russian)

V. Lozin, R. Mosca
Independent sets and extensions of 2K_2-free graphs
Discrete Appl. Math. 146 74-80 (2005)

N.V.R. Mahadev
Vertex deletion and stability number
Research report ORWP 90/2 Dept. of Mathematics, Swiss Fed.Inst. of Technology 1990

A. Apostolico, M.J. Atallah, S.E. Hambrusch
New clique and independent set algorithms for circle graphs.
Discrete Appl. Math 36 (1992) 1-24 Erratum: Discrete Appl. Math 41 (1993) 179-180

G.J. Minty
On maximal independent sets of vertices in claw--free graphs
J. Comb. Theory (B) 28 1980 284--304

V.E. Alekseev
A polynomial algorithm for finding maximum independent sets in fork-free graphs
Discrete Ann. Operation Res., Ser. 1 6 (1999) 3-19 (in Russian)

F. Gavril
Maximum weight independent sets and cliques in intersection graphs of filaments.
Information Processing Letters 73(5-6) 181-188 (2000)

G.B. Mertzios
An intersection model for multitolerance graphs: Efficient algorithms and hierarchy
Proc. of 21 annual ACM-SIAM symposium on Discrete algorithms SODA2011 1306-1317 (2011)

A. Brandstaedt, V.V. Lozin, R. Mosca
Independent sets of maximum weight in apple-free graphs
SIAM J. Discrete Math. Vol.24 No.1 239-254 (2010)

M. Gr\"otschel, L. Lov\'asz, A. Schrijver
The ellipsoid method and its consequences in combinatorial optimization
Combinatorica 1 169--197, 1981 Corrigendum

E. Cenek, L. Stewart
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Appl. Math. 131, No.1 77-91 (2003)

G.B. Mertzios, I. Sau, S. Zaks
A new intersection model and improved algorithms for tolerance graphs
SIAM J. on Discrete Math. 23(4) 1800-1813 (2009)

J.P. Spinrad, R. Sritharan
Algorithms for weakly triangulated graphs
Discrete Appl. Math. 59 1995 181--191

(decision variant)

M. Kaminski
Max-cut and containment relations in graphs
Proceedings of WG 2010, Lecture Notes in Computer Science 6410, 15-26 (2010)

M. Kaminski
Max-cut and containment relations in graphs
Proceedings of WG 2010, Lecture Notes in Computer Science 6410, 15-26 (2010)