Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 1 h ago
Peer-reviewedCC BY 4.0The Electronic Journal of Combinatorics

Boolean Combinations of Graphs

  • Sarosh Adenwalla
  • Samuel Braunfeld
  • John Sylvester
  • Viktor Zamaraev
Open at sourcePDFDOICite

Abstract

Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and limitations of Boolean combinations in this context, we investigate how they affect different combinatorial and structural properties of graphs, in particular χ-boundedness, as well as characterize the structure of Boolean combinations of graphs from various classes.

Related

  1. On the Minimal Controllability of Boolean Networks With k-Regular Dependency Graphs
    Christopher H. Fok, Chi-Wing Wong, Wai-Ki Ching
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Exact volume computation for Boolean quadric polytopes of series-parallel graphs
    Jon Lee
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  3. Boolean Trusses as Rectangular Bands and Boolean Rings
    Ryszard R. Andruszkiewicz, Bernard Rybołowicz
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. Canonical Directed Laplacian on F_2^4, Symmetry-Induced Two-Scale Coupling, and the Structural Isomorphism of a 64-Copy Boolean Graph Assembly
    Alejandro Diaz
    PreprintLicence not statedFull text5 citedGeometry & topologyOpenAlex
  5. The Boolean Prime Ideal Theorem and Vitali Sets
    Jindrich Zapletal
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv

Cite

BibTeXRIS
BibTeX
@article{adenwalla2026boolean,
  title = {{Boolean Combinations of Graphs}},
  author = {Sarosh Adenwalla and Samuel Braunfeld and John Sylvester and Viktor Zamaraev},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  month = oct,
  doi = {10.37236/14170},
  url = {https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p12},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Boolean Combinations of Graphs
AU  - Sarosh Adenwalla
AU  - Samuel Braunfeld
AU  - John Sylvester
AU  - Viktor Zamaraev
PY  - 2026
DA  - 2026/10/23
JO  - The Electronic Journal of Combinatorics
DO  - 10.37236/14170
UR  - https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p12
AB  - Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and limitations of Boolean combinations in this context, we investigate how they affect different combinatorial and structural properties of graphs, in particular χ-boundedness, as well as characterize the structure of Boolean combinations of graphs from various classes.
SN  - 1077-8926
ER  -