Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2309.05874

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2309.05874 (math)
[Submitted on 11 Sep 2023 (v1) , last revised 6 May 2025 (this version, v3)]

Title: Cop-width, flip-width and strong colouring numbers

Title: 边翻数、翻转数和强着色数

Authors:Robert Hickingbotham
Abstract: Cop-width and flip-width are new families of graph parameters introduced by Toru\'nczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and twin-width. In this paper, we bound the cop-width and flip-width of a graph by its strong colouring numbers. In particular, we show that for every $r\in \mathbb{N}$, every graph $G$ has $\text{copwidth}_r(G)\leq \text{scol}_{4r}(G)$. This implies that every class of graphs with linear strong colouring numbers has linear cop-width and linear flip-width. We use this result to deduce improved bounds for cop-width and flip-width for various sparse graph classes.
Abstract: Cop-宽度和翻转-宽度是图参数的两个新族,由托鲁ńczyk(2023年)引入,它们推广了树宽、退化性、广义着色数、 clique-宽度和双宽。 在本文中,我们通过图的强着色数来限制cop-宽度和翻转-宽度。特别是,我们证明了对于每个 $r\in \mathbb{N}$,每个图 $G$有 $\text{copwidth}_r(G)\leq \text{scol}_{4r}(G)$。 这意味着每个强着色数具有线性的图类也具有线性的cop-宽度和线性的翻转-宽度。 我们利用这个结果推导出各种稀疏图类的cop-宽度和翻转-宽度的改进界限。
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2309.05874 [math.CO]
  (or arXiv:2309.05874v3 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2309.05874
arXiv-issued DOI via DataCite
Journal reference: Discrete Mathematics & Theoretical Computer Science, vol. 27:2, Graph Theory (May 7, 2025) dmtcs:14976
Related DOI: https://doi.org/10.46298/dmtcs.14976
DOI(s) linking to related resources

Submission history

From: Robert Hickingbotham [view email]
[v1] Mon, 11 Sep 2023 23:53:03 UTC (12 KB)
[v2] Wed, 16 Apr 2025 13:12:12 UTC (53 KB)
[v3] Tue, 6 May 2025 14:03:42 UTC (27 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
math
< prev   |   next >
new | recent | 2023-09
Change to browse by:
math.CO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号