Forbidden induced subgraphs for bounded \(p\)-intersection number
From MaRDI portal
Publication:898105
DOI10.1016/j.disc.2015.09.022zbMath1327.05238arXiv1507.04258OpenAlexW2162839103MaRDI QIDQ898105
Dieter Rautenbach, José W. C. Pinto, Jayme Luiz Szwarcfiter, Claudson F. Bornstein
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04258
Related Items
Ramsey-type results for path covers and path partitions. II: Digraphs, A Ramsey-type theorem for the matching number regarding connected graphs
Cites Work
- Dot product representations of planar graphs
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
- Dot product representations of graphs
- General results on tolerance intersection graphs
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Topics in Intersection Graph Theory
- The 2‐intersection number of paths and bounded‐degree trees
- Onp-intersection representations
- The Representation of a Graph by Set Intersections