Cover Image

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fang, Qiming, Shao, Sihong, Wu, Yuxuan
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

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

Lower bounds for graph reconstruction with maximal independent set queries
by: Michel, Lukas, et al.
Published: (2024)

Minimal spanning arborescence
by: Ray, Gourab, et al.
Published: (2024)

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

Improved exploration of temporal graphs
by: Bastide, Paul, et al.
Published: (2025)

Reconstructing edge-deleted unicyclic graphs
by: Pizzimenti, Anthony E., et al.
Published: (2024)

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

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

On the complexity of edge subdivision to $H$-free graphs
by: Piecyk, Marta, et al.
Published: (2026)

A note on Ordered Ruzsa-Szemerédi graphs
by: Pratt, Kevin
Published: (2025)

Faithful universal graphs for minor-closed classes
by: Bastide, Paul, et al.
Published: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)

Representative set statements for delta-matroids and the Mader delta-matroid
by: Wahlström, Magnus
Published: (2023)

Enumerating all minimal hitting sets in polynomial total time
by: Wild, Marcel
Published: (2023)

Liar's vertex-edge domination in unit disk graph
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Faster diameter computation in graphs of bounded Euler genus
by: Kluk, Kacper, et al.
Published: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

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

Improved space-time tradeoff for TSP via extremal set systems
by: Dallant, Justin, et al.
Published: (2026)

Testing H-freeness on sparse graphs, the case of bounded expansion
by: Humeau, Samuel, et al.
Published: (2025)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
by: Chalopin, Jérémie, et al.
Published: (2025)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

Kernelization for list $H$-coloring for graphs with small vertex cover
by: Piecyk, Marta, et al.
Published: (2025)

Erdős-Gyárfás conjecture on graphs without long induced paths
by: Hegde, Anand Shripad, et al.
Published: (2024)

On 2-strong connectivity orientations of mixed graphs and related problems
by: Georgiadis, Loukas, et al.
Published: (2023)

Making an oriented graph acyclic using inversions of bounded or prescribed size
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
by: Jenssen, Matthew, et al.
Published: (2024)

The connectivity carcass of a vertex subset in a graph: both odd and even case
by: Baswana, Surender, et al.
Published: (2025)

Burning rooted graph products
by: Peca-Medlin, John
Published: (2026)

Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
by: Shao, Shuai, et al.
Published: (2025)

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

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

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

Efficient space reduction techniques by optimized majority rules for the Kemeny aggregation problem and beyond
by: Phung, Xuan Kien, et al.
Published: (2025)

Smoothed analysis for graph isomorphism
by: Anastos, Michael, et al.
Published: (2024)

Efficient algorithms for the Potts model on small-set expanders
by: Carlson, Charles, et al.
Published: (2020)