Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
From MaRDI portal
(Redirected from Publication:415269)
Recommendations
- Interval digraphs: An analogue of interval graphs
- Interval-like graphs and digraphs
- scientific article; zbMATH DE number 4091559
- On the homogeneous representation of interval graphs
- scientific article; zbMATH DE number 1735663
- On the enumeration of interval graphs
- scientific article; zbMATH DE number 1933220
- Homogeneously representable interval graphs
- On interval representations of graphs
- scientific article; zbMATH DE number 4043897
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 5030273 (Why is no real title available?)
- A characterization of interval catch digraphs
- Adjusted interval digraphs
- Bi‐arc graphs and the complexity of list homomorphisms
- Complexity of conservative constraint satisfaction problems
- Digraph matrix partitions and trigraph homomorphisms
- From graph coloring to constraint satisfaction: there and back again
- Incidence matrices and interval graphs
- Interval digraphs: An analogue of interval graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- List homomorphisms and circular arc graphs
- List homomorphisms to reflexive graphs
- Polynomial graph-colorings
- Recognition and characterization of chronological interval digraphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Representation of a finite graph by a set of intervals on the real line
- Some remarks on interval graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The LBFS structure and recognition of interval graphs
- The dichotomy of list homomorphisms for digraphs
Cited in
(24)- scientific article; zbMATH DE number 7228418 (Why is no real title available?)
- Minimum Cost Homomorphisms to Reflexive Digraphs
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
- Strong Chordality of Graphs with Possible Loops
- Bi-arc digraphs: recognition algorithm and applications
- A recognition algorithm for adjusted interval digraphs
- Classes of intersection digraphs with good algorithmic properties
- Min orderings and list homomorphism dichotomies for graphs and signed graphs
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Recognition and characterization of chronological interval digraphs
- 2-nested matrices: towards understanding the structure of circle graphs
- Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets
- Minimum Cost Homomorphism Dichotomy for Oriented Cycles
- Adjusted interval digraphs
- Interval-like graphs and digraphs
- Digraph matrix partitions and trigraph homomorphisms
- Bounded Tree-Width and CSP-Related Problems
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
- Recognizing interval bigraphs by forbidden patterns
- Strict chordal and strict split digraphs
- Min-orderable digraphs
- On the kernel and related problems in interval digraphs
- Chordal digraphs
This page was built for publication: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415269)
