Imagen de Portada

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chang, Yeonsu, Kwon, O-joung, Lee, Myounghwan
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Moderately beyond clique-width: reduced component max-leaf and related parameters
por: Bonnet, Édouard, et al.
Publicado: (2026)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

Perturbation results for distance-edge-monitoring numbers
por: Yang, Chenxu, et al.
Publicado: (2023)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
por: d'Orsi, Tommaso, et al.
Publicado: (2024)

$α_i$-Metric Graphs: Hyperbolicity
por: Dragan, Feodor F., et al.
Publicado: (2024)

Twin-width one
por: Ahn, Jungho, et al.
Publicado: (2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
por: Bencs, Ferenc, et al.
Publicado: (2025)

Graph parameters that are coarsely equivalent to path-length
por: Dragan, Feodor F., et al.
Publicado: (2025)

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)

Interval H-graphs : Recognition and forbidden obstructions
por: Müller, Haiko, et al.
Publicado: (2025)

Enumerating minimal solution sets for metric graph problems
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
por: Lau, Lap Chi, et al.
Publicado: (2024)

Holey graphs: very large Betti numbers are testable
por: Szabó, Dániel, et al.
Publicado: (2024)

Designing sparse temporal graphs satisfying connectivity requirements
por: Bellitto, Thomas, et al.
Publicado: (2026)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

Generating minimal redundant and maximal irredundant sets in incidence graphs
por: Castelo, Emanuel, et al.
Publicado: (2026)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
por: Castelo, Emanuel, et al.
Publicado: (2025)

Quasi-linear distance query reconstruction for graphs of bounded treelength
por: Bastide, Paul, et al.
Publicado: (2024)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
por: Ghanbari, Babak, et al.
Publicado: (2025)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
por: Galby, Esther, et al.
Publicado: (2025)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
por: Arkhipov, Pavel, et al.
Publicado: (2024)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
por: Ingels, Florian, et al.
Publicado: (2026)

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
por: An, Shinwoo, et al.
Publicado: (2024)

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

A characterization of testable hypergraph properties
por: Joos, Felix, et al.
Publicado: (2017)

A logarithmic approximation of linearly ordered colourings
por: Håstad, Johan, et al.
Publicado: (2024)

A Uniformly Random Solution to Algorithmic Redistricting
por: Cai, Jin-Yi, et al.
Publicado: (2024)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
por: Bourneuf, Romain, et al.
Publicado: (2025)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
por: Iwata, Satoru, et al.
Publicado: (2024)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
por: Jana, Satyabrata, et al.
Publicado: (2025)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
por: Shakeri, Heman, et al.
Publicado: (2025)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
por: Ghanbari, Babak, et al.
Publicado: (2026)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
por: Bartier, Valentin, et al.
Publicado: (2023)