The following pages link to (Q4507228):
Displaying 47 items.
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Constructing SAT Filters with a Quantum Annealer (Q3453216) (← links)
- Mixing 3-Colourings in Bipartite Graphs (Q3508565) (← links)
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- Isoperimetric Problem and Meta-fibonacci Sequences (Q3511309) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Computing Sharp 2-Factors in Claw-Free Graphs (Q3599127) (← links)
- Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization (Q3601367) (← links)
- A Separator Theorem for String Graphs and Its Applications (Q3605480) (← links)
- From Graph Theory to Models of Economic Networks. A Tutorial (Q3606076) (← links)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- (Q4524269) (← links)
- Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
- Perfectness of a graph associated with annihilating ideals of a ring (Q4577854) (← links)
- Patterns of patterns of synchronization: Noise induced attractor switching in rings of coupled nonlinear oscillators (Q4606939) (← links)
- On the comaximal ideal graph of a commutative ring (Q4633205) (← links)
- Equitable colourings of Borel graphs (Q5014071) (← links)
- On Baire measurable colorings of group actions (Q5019557) (← links)
- Operations on independence numbers of certain graph classes (Q5031875) (← links)
- Extremal Betti numbers of symbolic powers of two-dimensional squarefree monomial ideals (Q5084303) (← links)
- A computation of the Castelnuovo-Mumford regularity of certain two-dimensional unmixed ideals (Q5107035) (← links)
- (Q5124709) (← links)
- Colouring games based on autotopisms of Latin hyper-rectangles (Q5198043) (← links)
- Parameterized Graph Cleaning Problems (Q5302063) (← links)
- (Q5315023) (← links)
- On Modulo Linked Graphs (Q5321708) (← links)
- On Finding Small 2-Generating Sets (Q5323086) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
- Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs (Q5860653) (← links)
- (Q5883634) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- Graph theory (Q5920521) (← links)
- On the level property of two-dimensional monomial ideals (Q6104120) (← links)
- Synchronization of power systems under stochastic disturbances (Q6163996) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
- A characterization of graphs whose small powers of their edge ideals have a linear free resolution (Q6548020) (← links)
- Notes on Knaster-Tarski theorem versus monotone nonexpansive mappings (Q6571204) (← links)
- Exploring multi-potential games in strategic form: a graph theoretic approach (Q6585521) (← links)
- Approximation algorithms for 2-PSP-2W-max and 2-CC-2W-max (Q6587426) (← links)
- On the mixed connectivity conjecture of Beineke and Harary (Q6596954) (← links)
- Depth of powers of edge ideals of Cohen-Macaulay trees (Q6636326) (← links)
- Hypergraph edge representations with the use of homological paths (Q6644071) (← links)
- The chromaticity of complete split graphs (Q6647871) (← links)
