Saved in:
| Main Authors: | Iraids, Jānis, Smotrovs, Juris |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2106.15018 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Graph polynomials: some questions on the edge
by: Farr, Graham, et al.
Published: (2024)
by: Farr, Graham, et al.
Published: (2024)
On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026)
by: Barsukov, Alexey, et al.
Published: (2026)
Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
by: Bom, David, et al.
Published: (2025)
by: Bom, David, et al.
Published: (2025)
The frequency $K_i$s for symmetrical traveling salesman problem
by: Wang, Yong
Published: (2025)
by: Wang, Yong
Published: (2025)
Complexity of Firefighting on Graphs
by: Althoetmar, Julius, et al.
Published: (2025)
by: Althoetmar, Julius, et al.
Published: (2025)
The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)
by: Abbasizanjani, Hoda, et al.
Published: (2020)
Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)
by: Pettersson, William, et al.
Published: (2022)
Graphs without a 3-connected subgraph are 4-colorable
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
Explicit two-sided unique-neighbor expanders
by: Hsieh, Jun-Ting, et al.
Published: (2023)
by: Hsieh, Jun-Ting, et al.
Published: (2023)
Directed branch-width: A directed analogue of tree-width
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)
Simplifying modular lattices by removing doubly irreducible elements
by: Kohonen, Jukka
Published: (2023)
by: Kohonen, Jukka
Published: (2023)
A unified worst case for classical simplex and policy iteration pivot rules
by: Disser, Yann, et al.
Published: (2023)
by: Disser, Yann, et al.
Published: (2023)
On the hull and interval numbers of oriented graphs
by: Araujo, J., et al.
Published: (2022)
by: Araujo, J., et al.
Published: (2022)
Two approaches to low-parametric SimRank computation
by: Berezin, Egor P., et al.
Published: (2026)
by: Berezin, Egor P., et al.
Published: (2026)
Graph Parameters, Universal Obstructions, and WQO
by: Paul, Christophe, et al.
Published: (2023)
by: Paul, Christophe, et al.
Published: (2023)
A New Temporal Interpretation of Cluster Editing
by: Bocci, Cristiano, et al.
Published: (2022)
by: Bocci, Cristiano, et al.
Published: (2022)
Reuniting $χ$-boundedness with polynomial $χ$-boundedness
by: Chudnovsky, Maria, et al.
Published: (2023)
by: Chudnovsky, Maria, et al.
Published: (2023)
On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)
by: Kartynnik, Yury, et al.
Published: (2016)
Posets are easily testable
by: Fekete, Panna Tímea, et al.
Published: (2023)
by: Fekete, Panna Tímea, et al.
Published: (2023)
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)
by: Calamoneri, Tiziana, et al.
Published: (2025)
The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)
by: Calamoneri, Tiziana, et al.
Published: (2025)
Bounds and Hardness Results for Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2024)
by: Gupta, Shiwali, et al.
Published: (2024)
Block coupling and rapidly mixing k-heights
by: Felsner, Stefan, et al.
Published: (2024)
by: Felsner, Stefan, et al.
Published: (2024)
A CSP approach to Graph Sandwich Problems
by: Bodirsky, Manuel, et al.
Published: (2025)
by: Bodirsky, Manuel, et al.
Published: (2025)
Rankwidth of Graphs with Balanced Separations: Expansion for Dense Graphs
by: Anand, Emile
Published: (2025)
by: Anand, Emile
Published: (2025)
Symmetric-Difference (Degeneracy) and Signed Tree Models
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
Edge-coloring problems with forbidden patterns and planted colors
by: Barsukov, Alexey, et al.
Published: (2025)
by: Barsukov, Alexey, et al.
Published: (2025)
Arborescences and Shortest Path Trees when Colors Matter
by: Ardra, P. S., et al.
Published: (2024)
by: Ardra, P. S., et al.
Published: (2024)
Metrics on Permutation Families Defined by a Restriction Graph
by: Tymoshenko, Danylo, et al.
Published: (2025)
by: Tymoshenko, Danylo, et al.
Published: (2025)
The Combinatorial Rank of Subsets: Metric Density in Finite Hamming Spaces
by: Abdurakhmanov, Jamolidin K.
Published: (2025)
by: Abdurakhmanov, Jamolidin K.
Published: (2025)
On roots of domination polynomials for friendship and book graphs
by: Rather, Bilal Ahmad
Published: (2026)
by: Rather, Bilal Ahmad
Published: (2026)
NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)
by: Fairbairn, David L., et al.
Published: (2024)
Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Computing a 3-role assignment is polynomial-time solvable on complementary prisms
by: Castonguay, Diane, et al.
Published: (2024)
by: Castonguay, Diane, et al.
Published: (2024)
Boolean combinations of graphs
by: Adenwalla, Sarosh, et al.
Published: (2024)
by: Adenwalla, Sarosh, et al.
Published: (2024)
The Gallai Vertex Problem is $Θ_2^p$-Complete
by: Nikabadi, Amir, et al.
Published: (2026)
by: Nikabadi, Amir, et al.
Published: (2026)
Vertex connectivity of the nonzero nonunit core of the comaximal graph of $\mathbb Z_n$
by: Rather, Bilal Ahmad
Published: (2026)
by: Rather, Bilal Ahmad
Published: (2026)
A Row-wise Algorithm for Graph Realization
by: van der Hulst, Rolf, et al.
Published: (2024)
by: van der Hulst, Rolf, et al.
Published: (2024)
The steady-states of splitter networks
by: Couëtoux, Basile, et al.
Published: (2024)
by: Couëtoux, Basile, et al.
Published: (2024)
Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)
by: Chudnovsky, Maria, et al.
Published: (2025)
Similar Items
-
Graph polynomials: some questions on the edge
by: Farr, Graham, et al.
Published: (2024) -
On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026) -
Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
by: Bom, David, et al.
Published: (2025) -
The frequency $K_i$s for symmetrical traveling salesman problem
by: Wang, Yong
Published: (2025) -
Complexity of Firefighting on Graphs
by: Althoetmar, Julius, et al.
Published: (2025)