The induced separation dimension of a graph
DOI10.1007/S00453-017-0353-XzbMATH Open1392.05094OpenAlexW2741115047MaRDI QIDQ722529FDOQ722529
Authors: Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart 
Publication date: 26 July 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0353-x
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cites Work
- Graph Classes: A Survey
- Sur le coloriage des graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Algorithmic graph theory and perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- Induced matchings
- Title not available (Why is that?)
- Induced matchings in asteroidal triple-free graphs
- Vertex ordering characterizations of graphs of bounded asteroidal number
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Separation dimension of graphs and hypergraphs
- Separation dimension of bounded degree graphs
- Dimensions of hypergraphs
- Coloring edges and vertices of graphs without short or long cycles
- New results on induced matchings
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Induced matchings in intersection graphs.
- Finding a maximum induced matching in weakly chordal graphs
- Caterpillar tolerance representations
- Boxicity and separation dimension
- Tree-decompositions of small pathwidth
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)
