Copertina

On the inversion number of oriented graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bang-Jensen, Jørgen, da Silva, Jonas Costa Ferreira, Havet, Frédéric
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the $(\leq p)$-inversion diameter of oriented graphs
di: Havet, Frédéric, et al.
Pubblicazione: (2026)

Acyclic dichromatic number of oriented graphs
di: Bang-Jensen, Jørgen, et al.
Pubblicazione: (2025)

On the minimum number of arcs in $4$-dicritical oriented graphs
di: Havet, Frédéric, et al.
Pubblicazione: (2023)

Diameter of the inversion graph
di: Havet, Frédéric, et al.
Pubblicazione: (2024)

Dichromatic number of chordal graphs
di: Bessy, Stéphane, et al.
Pubblicazione: (2023)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
di: Duron, Julien, et al.
Pubblicazione: (2023)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
di: Aboulker, Pierre, et al.
Pubblicazione: (2024)

Constrained Flows in Networks
di: Bessy, Stéphane, et al.
Pubblicazione: (2023)

Cop numbers of periodic graphs
di: De Carufel, Jean-Lou, et al.
Pubblicazione: (2023)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
di: Das, Sandip, et al.
Pubblicazione: (2023)

EPPA numbers of graphs
di: Bradley-Williams, David, et al.
Pubblicazione: (2023)

On semi-transitive orientability of circulant graphs
di: Srinivasan, Eshwar, et al.
Pubblicazione: (2024)

Some short notes on oriented line graphs and related matrices
di: Antony, Jacob, et al.
Pubblicazione: (2025)

On cuts of small chromatic number in sparse graphs
di: Aubian, Guillaume, et al.
Pubblicazione: (2025)

The Frank number and nowhere-zero flows on graphs
di: Goedgebeur, Jan, et al.
Pubblicazione: (2023)

Biclique immersions in graphs with independence number 2
di: Botler, Fábio, et al.
Pubblicazione: (2023)

More results on the $z$-chromatic number of graphs
di: Khaleghi, Abbas, et al.
Pubblicazione: (2023)

Weak coloring numbers of minor-closed graph classes
di: Hodor, Jędrzej, et al.
Pubblicazione: (2024)

Winding number and circular 4-coloring of signed graphs
di: Gujgiczer, Anna, et al.
Pubblicazione: (2023)

Representation number of word-representable co-bipartite graph
di: Das, Biswajit, et al.
Pubblicazione: (2025)

Three-dimensional graph products with unbounded stack-number
di: Eppstein, David, et al.
Pubblicazione: (2022)

Cops and robber in graphs with bounded vertex cover number
di: Bose, Prosenjit, et al.
Pubblicazione: (2026)

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
di: Ai, Jiangdong, et al.
Pubblicazione: (2025)

The tripartite-circle crossing number of graphs with two small partition classes
di: Camacho, Charles, et al.
Pubblicazione: (2021)

Centered colorings and weak coloring numbers in minor-closed graph classes
di: Hodor, Jędrzej, et al.
Pubblicazione: (2026)

Tree-independence number of $P_5$-free graphs with no large bicliques
di: Blažej, Václav, et al.
Pubblicazione: (2026)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
di: Das, Sandip, et al.
Pubblicazione: (2023)

Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
di: Dai, Mengyao, et al.
Pubblicazione: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
di: Hertz, Alain, et al.
Pubblicazione: (2021)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
di: Pilipczuk, Marcin, et al.
Pubblicazione: (2023)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
di: Botler, Fábio, et al.
Pubblicazione: (2025)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
di: Das, Sandip, et al.
Pubblicazione: (2023)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
di: Hertz, Alain, et al.
Pubblicazione: (2021)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
di: Martínez, J. A., et al.
Pubblicazione: (2024)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
di: Jedličková, Nikola, et al.
Pubblicazione: (2023)

On the hull and interval numbers of oriented graphs
di: Araujo, J., et al.
Pubblicazione: (2022)

Some results involving the $A_α$-eigenvalues for graphs and line graphs
di: Junior, Joao Domingos Gomes da Silva, et al.
Pubblicazione: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
di: Le, Hoang-Oanh, et al.
Pubblicazione: (2023)

Chemically inspired Erdős-Rényi oriented hypergraphs
di: Garcia-Chung, Angel, et al.
Pubblicazione: (2023)