Pages that link to "Item:Q1886097"
From MaRDI portal
The following pages link to Algorithmic graph theory and perfect graphs (Q1886097):
Displayed 50 items.
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
- On the complexity of cover-incomparability graphs of posets (Q841163) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Unoriented Laplacian maximizing graphs are degree maximal (Q932145) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Aliased register allocation for straight-line programs is NP-complete (Q954999) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Approximation algorithm for coloring of dotted interval graphs (Q963476) (← links)
- On right-angled Artin groups without surface subgroups. (Q965090) (← links)
- Minimal split completions (Q967310) (← links)
- Obstacle numbers of graphs (Q977184) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- The \(\langle t \rangle \)-property of some classes of graphs (Q998518) (← links)
- Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- On b-perfect chordal graphs (Q1043818) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Graphs with maximal signless Laplacian spectral radius (Q2267405) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- Subtree filament graphs are subtree overlap graphs (Q2380028) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- On balanced graphs (Q2583124) (← links)
- Chordal multipartite graphs and chordal colorings (Q2643326) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES (Q3397507) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)