Complexity of representation of graphs by set systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Graphe représentatif des arêtes d'un multigraphe
- Incidence matrices and interval graphs
- Intersection graphs of curves in the plane
- On colouring random graphs
- On set systems determined by intersections
- Parallel concepts in graph theory
- Some simplified NP-complete graph problems
- Sur deux propriétés des classes d'ensembles
- The NP-completeness of the bandwidth minimization problem
- The Representation of a Graph by Set Intersections
Cited in
(9)- Unique intersectability of diamond-free graphs
- Clique coverings and claw-free graphs
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
- Edge intersection graphs of linear 3-uniform hypergraphs
- Local clique covering of claw-free graphs
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
- Edge intersection graphs of linear 3-uniform hypergraphs
- Applications of edge coverings by cliques
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: Complexity of representation of graphs by set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158768)
