Three aspects of the MSTCI problem
Fuente:
arXiv
Saved in:
| Main Authors: | Dubinsky, Manuel, Massri, César, Taubin, Gabriel |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
tinygarden -- A java package for testing properties of spanning trees
by: Dubinsky, Manuel, et al.
Published: (2024)
by: Dubinsky, Manuel, et al.
Published: (2024)
Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2021)
by: Dubinsky, Manuel, et al.
Published: (2021)
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2024)
by: Dubinsky, Manuel, et al.
Published: (2024)
The red-blue-yellow matching problem
by: Aprile, Manuel, et al.
Published: (2026)
by: Aprile, Manuel, et al.
Published: (2026)
Three-chromatic geometric hypergraphs
by: Damásdi, Gábor, et al.
Published: (2021)
by: Damásdi, Gábor, et al.
Published: (2021)
The Hajnal--Rothschild problem
by: Frankl, Peter, et al.
Published: (2025)
by: Frankl, Peter, et al.
Published: (2025)
Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)
by: Eppstein, David, et al.
Published: (2022)
A note on the Alon-Saks-Seymour problem
by: Fox, Jacob
Published: (2026)
by: Fox, Jacob
Published: (2026)
On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)
by: Chakraborty, Dipayan, et al.
Published: (2018)
On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)
by: Knauer, Kolja, et al.
Published: (2025)
Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)
by: Gravier, Sylvain, et al.
Published: (2025)
Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)
by: Couto, Fernanda, et al.
Published: (2024)
A note on the distinct distances problem over finite fields
by: Brukhim, Nataly, et al.
Published: (2025)
by: Brukhim, Nataly, et al.
Published: (2025)
Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)
by: Gravier, Sylvain, et al.
Published: (2026)
New small regular graphs of given girth: the cage problem and beyond
by: Exoo, Geoffrey, et al.
Published: (2025)
by: Exoo, Geoffrey, et al.
Published: (2025)
More on the Erd\H os--Kleitman problem on matchings in set families
by: Kupavskii, Andrey, et al.
Published: (2026)
by: Kupavskii, Andrey, et al.
Published: (2026)
The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)
by: Cameron, Kathie, et al.
Published: (2024)
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
by: Enright, Jessica, et al.
Published: (2025)
by: Enright, Jessica, et al.
Published: (2025)
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)
by: Soltani, Hossein, et al.
Published: (2018)
A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)
by: Kupavskii, Andrey, et al.
Published: (2025)
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
by: Falgas-Ravry, Victor, et al.
Published: (2022)
by: Falgas-Ravry, Victor, et al.
Published: (2022)
A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024)
by: Jain, Suryaansh, et al.
Published: (2024)
Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Computing fixed point free automorphisms of graphs
by: Abiad, Aida, et al.
Published: (2026)
by: Abiad, Aida, et al.
Published: (2026)
Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
by: la Tour, Max Dupré, et al.
Published: (2025)
by: la Tour, Max Dupré, et al.
Published: (2025)
On Generalizations of Pairwise Compatibility Graphs
by: Calamoneri, Tiziana, et al.
Published: (2021)
by: Calamoneri, Tiziana, et al.
Published: (2021)
$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)
by: la Tour, Max Dupré, et al.
Published: (2024)
The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)
by: Tiskin, Alexander
Published: (2022)
Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)
by: van Uem, Theo
Published: (2017)
Three observations on the Colin de Verdière spectral graph parameter
by: Kaluža, Vojtěch, et al.
Published: (2024)
by: Kaluža, Vojtěch, et al.
Published: (2024)
Coloring problems on arrangements of pseudolines
by: Roch, Sandro
Published: (2024)
by: Roch, Sandro
Published: (2024)
Sunflowers and Ramsey problems for restricted intersections
by: Janzer, Barnabás, et al.
Published: (2025)
by: Janzer, Barnabás, et al.
Published: (2025)
Algorithmic methods of finite discrete structures. Graph clique problem
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)
by: Jiménez, Andrea, et al.
Published: (2023)
EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)
by: Bradley-Williams, David, et al.
Published: (2023)
Coloring Grids Avoiding Bicolored Paths
by: Keskinkilic, Derman, et al.
Published: (2023)
by: Keskinkilic, Derman, et al.
Published: (2023)
Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)
by: Foucaud, Florent, et al.
Published: (2023)
Similar Items
-
tinygarden -- A java package for testing properties of spanning trees
by: Dubinsky, Manuel, et al.
Published: (2024) -
Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2021) -
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2024) -
The red-blue-yellow matching problem
by: Aprile, Manuel, et al.
Published: (2026) -
Three-chromatic geometric hypergraphs
by: Damásdi, Gábor, et al.
Published: (2021)