Image de couverture de livre

Token Jumping in Planar Graphs has Linear Sized Kernels

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Cranston, Daniel W.
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics Computational Complexity 05C69, 05C10, 05C85
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
par: Bousquet, Nicolas, et autres
Publié: (2025)

A simple quadratic kernel for Token Jumping on surfaces
par: Cranston, Daniel W., et autres
Publié: (2024)

Determining distances and consensus between mutation trees
par: Cunha, Luís, et autres
Publié: (2025)

On Intersection Graphs of Graphs and Hypergraphs: A Survey
par: Naik, Ranjan N.
Publié: (2018)

Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
par: Jaworska, Justyna, et autres
Publié: (2025)

Bounding Clique Size in Squares of Planar Graphs
par: Cranston, Daniel W.
Publié: (2023)

Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability
par: Allagan, Julian, et autres
Publié: (2026)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
par: Boros, Endre, et autres
Publié: (2023)

Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
par: Dourado, Mitre C., et autres
Publié: (2023)

The 2-domination number of cylindrical graphs
par: Martínez, José Antonio, et autres
Publié: (2024)

The Upper Clique Transversal Problem
par: Milanič, Martin, et autres
Publié: (2023)

The independence ratio of 4-cycle-free planar graphs
par: Kelly, Tom, et autres
Publié: (2023)

On irreversible spread of influence in edge-weighted graphs
par: Zaker, Manouchehr
Publié: (2019)

$K_2$-Hamiltonian Graphs: II
par: Goedgebeur, Jan, et autres
Publié: (2023)

Awesome graph parameters
par: Štorgel, Kenny Bešter, et autres
Publié: (2025)

Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets
par: Enami, Kengo, et autres
Publié: (2025)

Graph Burning: Bounds and Hardness
par: Antony, Dhanyamol, et autres
Publié: (2024)

Layered tree-independence number and clique-based separators
par: Dallard, Clément, et autres
Publié: (2025)

Token sliding independent set reconfiguration on block graphs
par: Francis, Mathew C., et autres
Publié: (2024)

Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
par: Goedgebeur, Jan, et autres
Publié: (2023)

The strong vertex span of trees
par: Grašič, Mateja, et autres
Publié: (2024)

Excluding an induced wheel minor in graphs without large induced stars
par: Choi, Mujin, et autres
Publié: (2025)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
par: Dallard, Clément, et autres
Publié: (2024)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
par: Furmańczyk, Hanna, et autres
Publié: (2020)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
par: Milanič, Martin, et autres
Publié: (2024)

Graphs with unique Grundy dominating sets
par: Brešar, Boštjan, et autres
Publié: (2021)

Secure Total Domination Number in Maximal Outerplanar Graphs
par: Aita, Yasufumi, et autres
Publié: (2024)

On Well-VE-Dominated Graphs
par: Büyükçolak, Yasemin
Publié: (2025)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
par: Bousquet, Nicolas, et autres
Publié: (2024)

On coloring graphs with well-distributed edge density
par: Hassan, Syed Mujtaba, et autres
Publié: (2024)

A Lower bound for Secure Domination Number of an Outerplanar Graph
par: Araki, Toru
Publié: (2024)

Exploring subgraph complementation to bounded degree graphs
par: Koch, Ivo, et autres
Publié: (2025)

Finding happiness by evolutionary algorithms
par: Shekarriz, Mohammad Hadi, et autres
Publié: (2025)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
par: Mkrtchyan, Vahan
Publié: (2024)

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
par: Askari, Siavash, et autres
Publié: (2024)

5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
par: Cranston, Daniel W., et autres
Publié: (2022)

The Local Structure Theorem for Graph Minors with finite index
par: Paul, Christophe, et autres
Publié: (2025)

Small-scale operations on graphic sequences
par: Rusu, Irena
Publié: (2026)

Conformality of Minimal Transversals of Maximal Cliques
par: Boros, Endre, et autres
Publié: (2024)

$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
par: Zaker, Manouchehr
Publié: (2024)