Pages that link to "Item:Q415269"

The following pages link to Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269):

Displaying 22 items.

• Recognition and characterization of chronological interval digraphs (Q396800) (← links)
• Strict chordal and strict split digraphs (Q516787) (← links)
• Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
• The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
• Chordal digraphs (Q1929220) (← links)
• 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
• A recognition algorithm for adjusted interval digraphs (Q2656971) (← links)
• (Q3304125) (← links)
• Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
• (Q5005172) (← links)
• Min-Orderable Digraphs (Q5130576) (← links)
• Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
• Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
• Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
• Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
• On the kernel and related problems in interval digraphs (Q6103517) (← links)
• Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
• Bi-arc digraphs: recognition algorithm and applications (Q6547945) (← links)
• Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets (Q6573396) (← links)
• Min orderings and list homomorphism dichotomies for graphs and signed graphs (Q6582375) (← links)
• Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)