Pages that link to "Item:Q1977431"

The following pages link to List homomorphisms and circular arc graphs (Q1977431):

Displaying 35 items.

• Representation characterizations of chordal bipartite graphs (Q2498738) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• A generalization of the theorem of Lekkerkerker and Boland (Q2568478) (← links)
• A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
• Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
• Adjusted interval digraphs (Q2839215) (← links)
• Counting List Matrix Partitions of Graphs (Q2944567) (← links)
• The complexity of the list homomorphism problem for graphs (Q3113761) (← links)
• Lexicographic Orientation Algorithms (Q3120444) (← links)
• (Q3304125) (← links)
• Surjective \texttt{H}-colouring over reflexive digraphs (Q3304148) (← links)
• Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
• Bi‐arc graphs and the complexity of list homomorphisms (Q4798127) (← links)
• (Q4993594) (← links)
• Consistency for counting quantifiers (Q5005107) (← links)
• (Q5005172) (← links)
• (Q5075768) (← links)
• Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
• Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
• Min-Orderable Digraphs (Q5130576) (← links)
• The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
• Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
• Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
• Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
• Introduction to the Maximum Solution Problem (Q5504706) (← links)
• Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
• (Q5874546) (← links)
• Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
• Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
• (Q6065467) (← links)
• List covering of regular multigraphs with semi-edges (Q6119831) (← links)
• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
• Min orderings and list homomorphism dichotomies for graphs and signed graphs (Q6582375) (← links)
• Gallai-like characterization of strong cocomparability graphs (Q6595514) (← links)
• Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)