The induced separation dimension of a graph

DOI10.1007/s00453-017-0353-xzbMath1392.05094OpenAlexW2741115047MaRDI QIDQ722529

Emile Ziedan, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart, Deepak Rajendraprasad

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

zbMATH Keywords

acyclic orientationvertex orderingasteroidal triplesinduced separation dimension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Perfect and nearly perfect separation dimension of complete and random graphs ⋮ Separation dimension and degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum weight independent sets and cliques in intersection graphs of filaments
• Separation dimension of graphs and hypergraphs
• Dimensions of hypergraphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Induced matchings
• Induced matchings in asteroidal triple-free graphs
• Induced matchings in intersection graphs.
• Independent sets in extensions of 2\(K_{2}\)-free graphs
• Finding a maximum induced matching in weakly chordal graphs
• Algorithmic graph theory and perfect graphs
• New results on induced matchings
• Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
• Boxicity and Separation Dimension
• Separation Dimension of Bounded Degree Graphs
• Graph Classes: A Survey
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs
• Sur le coloriage des graphs
• Tree-decompositions of small pathwidth

This page was built for publication: The induced separation dimension of a graph