On the homogeneous representation of interval graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- Homogeneously representable interval graphs
- On minimum intersection of two minimum dominating sets of interval graphs
- An integer programming model for the minimum interval graph completion problem
- Bounding the clique-width of H-free chordal graphs
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Maximum weight independent sets in classes related to claw-free graphs
- scientific article; zbMATH DE number 32301 (Why is no real title available?)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Sources in posets and comparability graphs
This page was built for publication: On the homogeneous representation of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970966)