Preparing graph states forbidding a vertex-minor
Fuente:
arXiv
Saved in:
| Main Authors: | Davies, James, Jena, Andrew |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Krenn-Gu conjecture for sparse graphs
by: Chandran, L. Sunil, et al.
Published: (2024)
by: Chandran, L. Sunil, et al.
Published: (2024)
On a tree-based variant of bandwidth and forbidding simple topological minors
by: Jacob, Hugo, et al.
Published: (2025)
by: Jacob, Hugo, et al.
Published: (2025)
Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025)
by: Farhi, Edward, et al.
Published: (2025)
Perfect state transfer using Markovian quantum walk
by: Dutta, Supriyo
Published: (2022)
by: Dutta, Supriyo
Published: (2022)
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)
Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)
by: Hodor, Jędrzej, et al.
Published: (2024)
Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)
by: Hodor, Jędrzej, et al.
Published: (2024)
Adjacency labelling for proper minor-closed graph classes
by: Dujmović, Vida, et al.
Published: (2026)
by: Dujmović, Vida, et al.
Published: (2026)
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)
Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)
by: Joret, Gwenaël, et al.
Published: (2026)
Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)
by: Claus, Quentin, et al.
Published: (2026)
Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)
by: Hodor, Jędrzej, et al.
Published: (2026)
Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)
by: Davies, James, et al.
Published: (2025)
Sunflowers and Ramsey problems for restricted intersections
by: Janzer, Barnabás, et al.
Published: (2025)
by: Janzer, Barnabás, et al.
Published: (2025)
$ε$-Uniform Mixing in Discrete Quantum Walks
by: Zhan, Hanmeng
Published: (2023)
by: Zhan, Hanmeng
Published: (2023)
Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
by: Mohan, Amulya, et al.
Published: (2024)
by: Mohan, Amulya, et al.
Published: (2024)
Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube
by: Zhan, Hanmeng
Published: (2024)
by: Zhan, Hanmeng
Published: (2024)
Random sampling of permutations through quantum circuits
by: Adhikari, Bibhas
Published: (2024)
by: Adhikari, Bibhas
Published: (2024)
Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
by: Cai, Jin-Yi, et al.
Published: (2022)
by: Cai, Jin-Yi, et al.
Published: (2022)
On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)
by: Adekanye, Melvin, et al.
Published: (2024)
$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)
by: Chakraborty, Dibyayan
Published: (2025)
The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
by: Liu, Yasong, et al.
Published: (2024)
by: Liu, Yasong, et al.
Published: (2024)
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Vertex-minor universal graphs for generating entangled quantum subsystems
by: Cautrès, Maxime, et al.
Published: (2024)
by: Cautrès, Maxime, et al.
Published: (2024)
Edge coloring lattice graphs
by: Kattemölle, Joris
Published: (2024)
by: Kattemölle, Joris
Published: (2024)
On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)
by: Davies, Ewan, et al.
Published: (2025)
Clique-width and induced topological minors
by: Bieliński, Paweł Rafał, et al.
Published: (2026)
by: Bieliński, Paweł Rafał, 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)
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)
A new vertex coloring heuristic and corresponding chromatic number
by: Zaker, Manouchehr
Published: (2020)
by: Zaker, Manouchehr
Published: (2020)
Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)
by: Hatzel, Meike, et al.
Published: (2025)
Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)
by: Kim, Gunwoo, et al.
Published: (2025)
Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)
by: Briański, Marcin, et al.
Published: (2024)
Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)
by: Dujmović, Vida, et al.
Published: (2024)
Improved bounds on the cop number when forbidding a minor
by: Kenter, Franklin, et al.
Published: (2023)
by: Kenter, Franklin, et al.
Published: (2023)
A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)
by: Bousquet, Nicolas, et al.
Published: (2016)
Coarse Menger property of quasi-minor excluded graphs and length spaces
by: Liu, Chun-Hung
Published: (2026)
by: Liu, Chun-Hung
Published: (2026)
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
by: Bonnet, Édouard, et al.
Published: (2022)
by: Bonnet, Édouard, et al.
Published: (2022)
Similar Items
-
Krenn-Gu conjecture for sparse graphs
by: Chandran, L. Sunil, et al.
Published: (2024) -
On a tree-based variant of bandwidth and forbidding simple topological minors
by: Jacob, Hugo, et al.
Published: (2025) -
Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025) -
Perfect state transfer using Markovian quantum walk
by: Dutta, Supriyo
Published: (2022) -
Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)