Copertina

Efficient polynomial-time approximation scheme for the genus of dense graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Jing, Yifan, Mohar, Bojan
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Guarding isometric subgraphs and Cops and Robber in planar graphs
di: de la Maza, Sebastián González Hermosillo, et al.
Pubblicazione: (2024)

The Dominating 4-Colour Theorem
di: Girão, António, et al.
Pubblicazione: (2026)

On approximating the rank of graph divisors
di: Bérczi, Kristóf, et al.
Pubblicazione: (2022)

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

Random 2-cell embeddings of multistars
di: Loth, Jesse Campion, et al.
Pubblicazione: (2021)

Sample compression schemes for balls in structurally sparse graphs
di: Bourneuf, Romain, et al.
Pubblicazione: (2026)

Bounded twin-width graphs are polynomially $χ$-bounded
di: Bourneuf, Romain, et al.
Pubblicazione: (2023)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
di: Baste, Julien, et al.
Pubblicazione: (2025)

Karp's patching algorithm on dense digraph
di: Frieze, Alan
Pubblicazione: (2025)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
di: Galliot, Florian, et al.
Pubblicazione: (2022)

Bounding the chromatic number of dense digraphs by arc neighborhoods
di: Klingelhoefer, Felix, et al.
Pubblicazione: (2023)

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)

Polynomial-time recognition and maximum independent set in Burling graphs
di: Rzążewski, Paweł, et al.
Pubblicazione: (2024)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
di: Loth, Jesse Campion, et al.
Pubblicazione: (2022)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
di: Inoue, Yuta, et al.
Pubblicazione: (2024)

Crossing numbers of dense graphs on surfaces
di: Hubard, Alfredo, et al.
Pubblicazione: (2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
di: Mütze, Torsten, et al.
Pubblicazione: (2024)

On universal graphs for trees and treewidth $k$ graphs
di: Kaul, Neel, et al.
Pubblicazione: (2025)

Determining a graph from its reconfiguration graph
di: Berthe, Gaétan, et al.
Pubblicazione: (2025)

Vertex-critical graphs in co-gem-free graphs
di: Beaton, Iain, et al.
Pubblicazione: (2024)

Effects of graph operations on star pairwise compatibility graphs
di: Monti, Angelo, et al.
Pubblicazione: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
di: Duron, Julien, et al.
Pubblicazione: (2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
di: de Lima, Paloma T., et al.
Pubblicazione: (2025)

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

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

Colouring t-perfect graphs
di: Chudnovsky, Maria, et al.
Pubblicazione: (2024)

On the expansion of Hanoi graphs
di: Eppstein, David, et al.
Pubblicazione: (2025)

Contractions in perfect graph
di: Dupont-Bouillard, Alexandre, et al.
Pubblicazione: (2024)

On total transitivity of graphs
di: Santra, Kamal
Pubblicazione: (2025)

Linear colorings of graphs
di: Hilaire, Claire, et al.
Pubblicazione: (2025)

Some polynomial classes for the acyclic orientation with parity constraint problem
di: Gravier, Sylvain, et al.
Pubblicazione: (2026)

A polynomial bound for the minimal excluded minors for a surface
di: Houdaigoui, Sarah, et al.
Pubblicazione: (2026)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
di: Bastide, Paul, et al.
Pubblicazione: (2024)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
di: Beaudou, Laurent, et al.
Pubblicazione: (2025)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2025)

Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
di: Tian, Ting, et al.
Pubblicazione: (2025)

A quasi-polynomial bound for the minimal excluded minors for a surface
di: Houdaigoui, Sarah, et al.
Pubblicazione: (2025)

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

On the balanceability of some graph classes
di: Dailly, Antoine, et al.
Pubblicazione: (2020)