Induced Separation Dimension

DOI10.1007/978-3-662-53536-3_11zbMath1417.05175OpenAlexW2527367333MaRDI QIDQ3181052

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

Publication date: 22 December 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53536-3_11

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Fractional and circular separation dimension of graphs

Cites Work

• 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
• Independent sets in extensions of 2\(K_{2}\)-free graphs
• Algorithmic graph theory and perfect graphs
• 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: Induced Separation Dimension