Cover Image

When all directed cycles have the same weight

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Berger, Eli, Carter, Daniel, Seymour, Paul
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C20 (Primary), 05C75, 05C22, 05C85 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Antisymmetric Line Graph
by: Bal, Hartosh Singh
Published: (2026)

$5$-list-coloring toroidal $6$-regular triangulations in linear time
by: Balachandran, Niranjan, et al.
Published: (2021)

Towards a dichotomy for the switch list homomorphism problem for signed graphs
by: Kim, Hyobin, et al.
Published: (2021)

Cofinality of Regular Tournaments
by: Hatem, Omar, et al.
Published: (2026)

Graphs whose Eulerian trails have unique labels
by: Kim, Donggyu, et al.
Published: (2026)

Domination on Vertex-weighted Graphs Induce by a Coloring
by: Garrido-Vizuete, María A., et al.
Published: (2025)

Improved lower bounds for the maximum order of an induced acyclic subgraph
by: Asgarli, Shamil, et al.
Published: (2025)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

When all directed cycles have length three
by: Seymour, Paul
Published: (2024)

Multigraphs with Unique Partition into Cycles
by: Cooper, Joshua, et al.
Published: (2025)

Cup Stacking in Graphs
by: Fay, Paul, et al.
Published: (2023)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)

On the singularity and the inverse of 3-colored digraphs
by: Zaffer, Md Isheteyak
Published: (2026)

Connected components and non-bipartiteness of generalized Paley graphs
by: Podestá, Ricardo A., et al.
Published: (2024)

Directed branch-width: A directed analogue of tree-width
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)

Induced minors and subpolynomial treewidth
by: Chudnovsky, Maria, et al.
Published: (2025)

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

5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
by: Inoue, Yuta, et al.
Published: (2025)

Coloring graphs as complete graph invariants
by: Asgarli, Shamil, et al.
Published: (2025)

Regular bipartite decompositions of pseudorandom graphs
by: Ferber, Asaf, et al.
Published: (2024)

Kernels in digraphs with colored vertices
by: Guevara, Mucuy-kak, et al.
Published: (2025)

Recolouring Homomorphisms to triangle-free reflexive graphs
by: Lee, Jae-baek, et al.
Published: (2021)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, et al.
Published: (2024)

Graphs with span 1 and shortest optimal walks
by: Dravec, Tanja, et al.
Published: (2024)

Broadcasting Agents and Adversary: A new variation on Cops and Robbers
by: Moses Jr., William K., et al.
Published: (2026)

Roman $\{2\}$-domination on Graphs with "few" 4-paths
by: Fernández, Lara, et al.
Published: (2025)

An Overview of Universal Obstructions for Graph Parameters
by: Paul, Christophe, et al.
Published: (2023)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)

On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)

Series-parallel graphs and hypercube degeneracy
by: Zhu, Daniel G.
Published: (2025)

Conformality of Minimal Transversals of Maximal Cliques
by: Boros, Endre, et al.
Published: (2024)

Awesome graph parameters
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

Which Phylogenetic Networks are Level-k Networks with Additional Arcs? Structure and Algorithms
by: Suzuki, Takatora, et al.
Published: (2025)

On irreversible spread of influence in edge-weighted graphs
by: Zaker, Manouchehr
Published: (2019)

Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
by: Nguyen, Tung, et al.
Published: (2023)

Spectral Bounds for Directed Graphs Via Asymmetric Matrices: Applications to Toughness
by: Carter, Rebecca
Published: (2025)

A structural duality for path-decompositions into parts of small radius
by: Albrechtsen, Sandra, et al.
Published: (2023)

Algorithmic releases on the spanning trees of suitable graphs
by: Imbesi, Maurizio, et al.
Published: (2017)