Saved in:
| Main Authors: | Jing, Yifan, Mohar, Bojan |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2011.08049 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Guarding isometric subgraphs and Cops and Robber in planar graphs
by: de la Maza, Sebastián González Hermosillo, et al.
Published: (2024)
by: de la Maza, Sebastián González Hermosillo, et al.
Published: (2024)
Random 2-cell embeddings of multistars
by: Loth, Jesse Campion, et al.
Published: (2021)
by: Loth, Jesse Campion, et al.
Published: (2021)
The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)
by: Girão, António, et al.
Published: (2026)
On approximating the rank of graph divisors
by: Bérczi, Kristóf, et al.
Published: (2022)
by: Bérczi, Kristóf, et al.
Published: (2022)
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)
by: Jedličková, Nikola, et al.
Published: (2023)
Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)
by: Bourneuf, Romain, et al.
Published: (2026)
Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)
by: Inoue, Yuta, et al.
Published: (2024)
Bounded twin-width graphs are polynomially $χ$-bounded
by: Bourneuf, Romain, et al.
Published: (2023)
by: Bourneuf, Romain, et al.
Published: (2023)
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
by: Loth, Jesse Campion, et al.
Published: (2022)
by: Loth, Jesse Campion, et al.
Published: (2022)
A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)
by: Baste, Julien, et al.
Published: (2025)
Karp's patching algorithm on dense digraph
by: Frieze, Alan
Published: (2025)
by: Frieze, Alan
Published: (2025)
Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2022)
by: Galliot, Florian, et al.
Published: (2022)
Bounding the chromatic number of dense digraphs by arc neighborhoods
by: Klingelhoefer, Felix, et al.
Published: (2023)
by: Klingelhoefer, Felix, et al.
Published: (2023)
Crossing numbers of dense graphs on surfaces
by: Hubard, Alfredo, et al.
Published: (2025)
by: Hubard, Alfredo, et al.
Published: (2025)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)
by: Pilipczuk, Marcin, et al.
Published: (2023)
Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)
by: Rzążewski, Paweł, 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)
by: Bencs, Ferenc, et al.
Published: (2025)
The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
by: Inoue, Yuta, et al.
Published: (2026)
by: Inoue, Yuta, et al.
Published: (2026)
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)
by: Kaul, Neel, et al.
Published: (2025)
Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)
by: Beaton, Iain, et al.
Published: (2024)
Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)
by: Monti, Angelo, et al.
Published: (2024)
Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)
by: Duron, Julien, et al.
Published: (2024)
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)
by: de Lima, Paloma T., et al.
Published: (2025)
EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)
by: Bradley-Williams, David, et al.
Published: (2023)
Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)
by: Havet, Frédéric, et al.
Published: (2024)
Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)
by: Eppstein, David, et al.
Published: (2025)
Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)
On total transitivity of graphs
by: Santra, Kamal
Published: (2025)
by: Santra, Kamal
Published: (2025)
Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)
by: Hilaire, Claire, et al.
Published: (2025)
Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)
by: Gravier, Sylvain, et al.
Published: (2026)
A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)
by: Houdaigoui, Sarah, et al.
Published: (2026)
Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)
by: Bastide, Paul, et al.
Published: (2024)
Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)
by: Beaudou, Laurent, et al.
Published: (2025)
Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
by: Tian, Ting, et al.
Published: (2025)
by: Tian, Ting, et al.
Published: (2025)
A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)
by: Houdaigoui, Sarah, et al.
Published: (2025)
Similar Items
-
Guarding isometric subgraphs and Cops and Robber in planar graphs
by: de la Maza, Sebastián González Hermosillo, et al.
Published: (2024) -
Random 2-cell embeddings of multistars
by: Loth, Jesse Campion, et al.
Published: (2021) -
The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026) -
On approximating the rank of graph divisors
by: Bérczi, Kristóf, et al.
Published: (2022) -
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)