Finding hypergraph immersion is fixed-parameter tractable
Fuente:
arXiv
Saved in:
| Main Authors: | Meng, Xiangyi, Tian, Yu |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)
by: Korhonen, Tuukka, et al.
Published: (2026)
An Overview of Universal Obstructions for Graph Parameters
by: Paul, Christophe, et al.
Published: (2023)
by: Paul, Christophe, et al.
Published: (2023)
On Intersection Graphs of Graphs and Hypergraphs: A Survey
by: Naik, Ranjan N.
Published: (2018)
by: Naik, Ranjan N.
Published: (2018)
The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)
by: Grašič, Mateja, et al.
Published: (2024)
Graph Burning: Bounds and Hardness
by: Antony, Dhanyamol, et al.
Published: (2024)
by: Antony, Dhanyamol, et al.
Published: (2024)
Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)
by: Gollin, J. Pascal, et al.
Published: (2023)
Excluding a Forest Induced Minor
by: Bonnet, Édouard, et al.
Published: (2025)
by: Bonnet, Édouard, et al.
Published: (2025)
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
Deduction, Constrained Zero Forcing, and Constrained Searching
by: Burgess, Andrea, et al.
Published: (2024)
by: Burgess, Andrea, et al.
Published: (2024)
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Anil, Arun, et al.
Published: (2023)
by: Anil, Arun, et al.
Published: (2023)
Vertex evaluation of multiplex graphs using Forman Curvature
by: Yamada, Taiki
Published: (2025)
by: Yamada, Taiki
Published: (2025)
On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025)
by: Hoàng, Chính T.
Published: (2025)
Face covers and rooted minors in bounded genus graphs
by: Fiorini, Samuel, et al.
Published: (2025)
by: Fiorini, Samuel, et al.
Published: (2025)
Braces of Perfect Matching Width 2
by: Giannopoulou, Archontia C., et al.
Published: (2019)
by: Giannopoulou, Archontia C., et al.
Published: (2019)
Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs
by: Delcourt, Michelle, et al.
Published: (2021)
by: Delcourt, Michelle, et al.
Published: (2021)
A note on highly connected $K_{2,\ell}$-minor free graphs
by: Bousquet, Nicolas, et al.
Published: (2023)
by: Bousquet, Nicolas, et al.
Published: (2023)
Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, et al.
Published: (2024)
by: Bousquet, Nicolas, et al.
Published: (2024)
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)
by: Paul, Christophe, et al.
Published: (2024)
The Local Structure Theorem for Graph Minors with finite index
by: Paul, Christophe, et al.
Published: (2025)
by: Paul, Christophe, et al.
Published: (2025)
Computing the permanental polynomial of $4k$-intercyclic bipartite graphs
by: Bapat, Ravindra B., et al.
Published: (2024)
by: Bapat, Ravindra B., et al.
Published: (2024)
Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
Dominated balanced separators in wheel-induced-minor-free graphs
by: Chudnovsky, Maria, et al.
Published: (2025)
by: Chudnovsky, Maria, et al.
Published: (2025)
Subchromatic numbers of powers of graphs with excluded minors
by: Cortés, Pedro P., et al.
Published: (2023)
by: Cortés, Pedro P., et al.
Published: (2023)
Solution to a problem on isolation of cliques in uniform hypergraphs
by: Borg, Peter
Published: (2025)
by: Borg, Peter
Published: (2025)
Awesome graph parameters
by: Štorgel, Kenny Bešter, et al.
Published: (2025)
by: Štorgel, Kenny Bešter, et al.
Published: (2025)
Alon-Tarsi for hypergraphs
by: Anholcer, Marcin, et al.
Published: (2024)
by: Anholcer, Marcin, et al.
Published: (2024)
Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
Hamilton decompositions of the directed 7-torus at odd modulus via root-flat certificates and a prefix-count construction
by: Park, SangHyun
Published: (2026)
by: Park, SangHyun
Published: (2026)
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
by: Zaker, Manouchehr
Published: (2021)
by: Zaker, Manouchehr
Published: (2021)
Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability
by: Allagan, Julian, et al.
Published: (2026)
by: Allagan, Julian, et al.
Published: (2026)
Finding happiness by evolutionary algorithms
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
Coloring hypergraphs with excluded minors
by: Steiner, Raphael
Published: (2022)
by: Steiner, Raphael
Published: (2022)
Minimal $L^p$-congestion spanning trees on weighted graphs
by: Lafuente, Alberto Castejón, et al.
Published: (2025)
by: Lafuente, Alberto Castejón, et al.
Published: (2025)
Characterising 4-tangles through a connectivity property
by: Carmesin, Johannes, et al.
Published: (2023)
by: Carmesin, Johannes, et al.
Published: (2023)
Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
by: Grigoriev, Alexander, et al.
Published: (2025)
by: Grigoriev, Alexander, et al.
Published: (2025)
Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
by: Jaworska, Justyna, et al.
Published: (2025)
by: Jaworska, Justyna, et al.
Published: (2025)
Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)
by: Thilikos, Dimitrios M., et al.
Published: (2023)
Graphs whose Eulerian trails have unique labels
by: Kim, Donggyu, et al.
Published: (2026)
by: Kim, Donggyu, et al.
Published: (2026)
Similar Items
-
Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026) -
An Overview of Universal Obstructions for Graph Parameters
by: Paul, Christophe, et al.
Published: (2023) -
On Intersection Graphs of Graphs and Hypergraphs: A Survey
by: Naik, Ranjan N.
Published: (2018) -
The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024) -
Graph Burning: Bounds and Hardness
by: Antony, Dhanyamol, et al.
Published: (2024)