Pages that link to "Item:Q1977431"
From MaRDI portal
The following pages link to List homomorphisms and circular arc graphs (Q1977431):
Displayed 50 items.
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- The structure of bi-arc trees (Q864126) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- On orthogonal ray trees (Q908312) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem (Q1869963) (← links)
- Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
- Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Extended skew partition problem (Q2433705) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Co-TT graphs and a characterization of split co-TT graphs (Q2448900) (← links)
- Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- Representation characterizations of chordal bipartite graphs (Q2498738) (← links)