Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Detecting an Odd Hole

From MaRDI portal
Publication:5133961
Jump to:navigation, search

DOI10.1145/3375720zbMath1491.68141arXiv1903.00208OpenAlexW3003164711MaRDI QIDQ5133961

Sophie Spirkl, Maria Chudnovsky, P. D. Seymour, Alexander D. Scott

Publication date: 11 November 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.00208

zbMATH Keywords

perfect graphsrecognition algorithmodd holes


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items

Detecting a long even hole, Finding a shortest even hole in polynomial time, Graphs of large chromatic number, FPT and kernelization algorithms for the induced tree problem, Polyhedral properties of the induced cluster subgraphs, Detecting a long odd hole



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5133961&oldid=19664489"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 15:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki