Image de couverture de livre

Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Yichen, Zhang, Haixiang, Lu, Mei
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
par: Wang, Yichen, et autres
Publié: (2024)

Linear recoloring diameter of degenerate chordal graphs and bounded treewidth graphs
par: Wang, Yichen, et autres
Publié: (2025)

Induced Ramsey problems for trees and graphs with bounded treewidth
par: Hunter, Zach, et autres
Publié: (2024)

Turán type problems for a fixed graph and a linear forest
par: Zhang, Haixiang, et autres
Publié: (2025)

Inversion diameter and treewidth
par: Wang, Yichen, et autres
Publié: (2024)

An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
par: Distel, Marc
Publié: (2025)

An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
par: Distel, Marc
Publié: (2025)

Graphs that are quasi-isometric to graphs with bounded treewidth
par: Hickingbotham, Robert
Publié: (2025)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Algorithmic study on liar's vertex-edge domination problem
par: Bhattacharya, Debojyoti, et autres
Publié: (2023)

Chordal graphs, even-hole-free graphs and sparse obstructions to bounded treewidth
par: Hajebi, Sepehr
Publié: (2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
par: Bonamy, Marthe, et autres
Publié: (2022)

On degree bounds of $k$-uniform hypergraphs with bounded matching number
par: Zhang, Haixiang, et autres
Publié: (2026)

The number of cut-edges and conflict-free connection number in planar graphs
par: Ha, Pham Hoang, et autres
Publié: (2026)

Improved bound on the number of edges of diameter-$k$-critical graphs
par: Wang, Xiaolin, et autres
Publié: (2024)

Turán number of complete bipartite graphs with bounded matching number
par: Luo, Huan, et autres
Publié: (2024)

On the number of edges in saturated partial embeddings of maximal planar graphs
par: Barát, János, et autres
Publié: (2025)

Cops and robber in graphs with bounded vertex cover number
par: Bose, Prosenjit, et autres
Publié: (2026)

On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
par: Barbieri, Marco, et autres
Publié: (2022)

On universal graphs for trees and treewidth $k$ graphs
par: Kaul, Neel, et autres
Publié: (2025)

Semistrong edge colorings of planar graphs
par: Lin, Yuquan, et autres
Publié: (2024)

The treewidth and pathwidth of graph unions
par: Alecu, Bogdan, et autres
Publié: (2022)

Excluding a clique or a biclique in graphs of bounded induced matching treewidth
par: Abrishami, Tara, et autres
Publié: (2024)

Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
par: Chudnovsky, Maria, et autres
Publié: (2024)

Nut graphs with a prescribed number of vertex and edge orbits
par: Bašić, Nino, et autres
Publié: (2025)

Linear bounds on treewidth in terms of excluded planar minors
par: Gollin, J. Pascal, et autres
Publié: (2024)

Tight upper bounds on the hop domination number of triangle-free graphs
par: Fujita, Shinya, et autres
Publié: (2025)

Lower bounds for the total (distance) $k$-domination number of a graph
par: Davila, Randy
Publié: (2024)

Chromatic polynomials of signed graphs and dominating-vertex deletion formulae
par: Greaves, Gary R. W., et autres
Publié: (2024)

On well (edge) dominated and equimatchable strong product graphs
par: Cao, Yixin, et autres
Publié: (2024)

The number of edges in graphs with bounded clique number and circumference
par: Dou, Chunyang, et autres
Publié: (2024)

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
par: Wang, Yichen, et autres
Publié: (2024)

Oriented diameter of graphs with given domination number
par: Wang, Xiaolin, et autres
Publié: (2025)

An improved upper bound for the domination number of a graph
par: Arumugam, Subramanian, et autres
Publié: (2024)

Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
par: Zhao, Peixue, et autres
Publié: (2022)

Note on vertex disjoint rainbow triangles in edge-colored graphs
par: Kritschgau, Jürgen, et autres
Publié: (2024)

The maximum number of triangles in graphs without vertex disjoint friendship graphs
par: Chen, Wanfang, et autres
Publié: (2026)

Depth of edge ideals and vertex connectivity of finite graphs
par: Hibi, Takayuki, et autres
Publié: (2026)

The $1$-nearly vertex independence number of a graph
par: Shozi, Zekhaya B.
Publié: (2024)