scientific article; zbMATH DE number 3332242
From MaRDI portal
Publication:5609148
Cited in
(21)- Partitioning graphs into complete and empty graphs
- On the chromatic number of multiple interval graphs and overlap graphs
- Covering and coloring problems for relatives of intervals
- Graph minors. V. Excluding a planar graph
- Neighborhood perfect graphs
- Covering with Euclidean boxes
- A Gallai-type transversal problem in the plane
- Split and balanced colorings of complete graphs
- Generalized split graphs and Ramsey numbers
- Well-quasi-order for permutation graphs omitting a path and a clique
- Recent techniques and results on the Erdős-Pósa property
- Red-blue clique partitions and (1-1)-transversals
- Erdös-Pósa Property of Obstructions to Interval Graphs
- Gallai-type results for multiple boxes and forests
- Balanced vertices in trees and a simpler algorithm to compute the genomic distance
- Erdős–Pósa property of obstructions to interval graphs
- Clique covers of complete graphs and piercing multitrack intervals
- The hereditary closure of the unigraphs
- The vertex sets of subtrees of a tree
- On the representation of triangulation graphs in trees
- Obstructions for partitioning into forests and outerplanar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5609148)
