On exact blockers and anti-blockers, -conjecture, and related problems
From MaRDI portal
Publication:628313
DOI10.1016/J.DAM.2010.11.014zbMATH Open1210.05039OpenAlexW1984059387WikidataQ123365251 ScholiaQ123365251MaRDI QIDQ628313FDOQ628313
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.014
blockerCIS graph\(\varDelta \)-conjectureanti-blockerbox-partitionCIS \(d\)-graphsexact anti-blockerexact blockerread-once Boolean functionsolid box-partition
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Transitiv orientierbare Graphen
- Imperfect and nonideal clutters: A common approach
- Edge colorings of complete graphs without tricolored triangles
- On graphs whose maximal cliques and stable sets intersect
- A Characterization of Almost CIS Graphs
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Combinatorial characterization of read-once formulae
- A note on perfect graphs
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
- Perfect couples of graphs
- Edge-colored complete graphs with precisely colored subgraphs
- Vertex- and edge-minimal and locally minimal graphs
- Lambda composition
- Colored graphs without colorful cycles
- Graph pairs and their entropies: Modularity problems
- An improvement on the complexity of factoring read-once Boolean functions
Cited In (8)
- On equistable, split, CIS, and related classes of graphs
- Detecting strong cliques
- Strong cliques in diamond-free graphs
- Strong cliques in vertex‐transitive graphs
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
- Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))
- On CIS circulants
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
Uses Software
This page was built for publication: On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628313)
