Recommendations
Cites work
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- Algorithmic graph theory and perfect graphs
- Boxicity and separation dimension
- Caterpillar tolerance representations
- Coloring edges and vertices of graphs without short or long cycles
- Dimensions of hypergraphs
- Finding a maximum induced matching in weakly chordal graphs
- Graph Classes: A Survey
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Induced matchings
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in intersection graphs.
- Maximum weight independent sets and cliques in intersection graphs of filaments
- New results on induced matchings
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Separation dimension of bounded degree graphs
- Separation dimension of graphs and hypergraphs
- Sur le coloriage des graphs
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- Tree-decompositions of small pathwidth
- Vertex ordering characterizations of graphs of bounded asteroidal number
Cited in
(3)
This page was built for publication: The induced separation dimension of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722529)
