Avoidable vertices and edges in graphs

From MaRDI portal

Revision as of 12:51, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2285088

Jump to:navigation, search

DOI10.1007/978-3-030-24766-9_10OpenAlexW2964566275MaRDI QIDQ2285088

Jesse Beisegel, Maria Chudnovsky, Mary Servatius, Martin Milanič, Vladimir A. Gurvich

Publication date: 16 January 2020

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (5)

Shifting paths to avoidable ones ⋮ Computing and listing avoidable vertices and paths ⋮ Computing and listing avoidable vertices and paths ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure

This page was built for publication: Avoidable vertices and edges in graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2285088&oldid=14859376"