Avoidable vertices and edges in graphs: Existence, characterization, and applications
Authors:
- Jesse BeisegelJBJesse Beisegel
- Maria ChudnovskyMCMaria Chudnovsky
- Vladimir GurvichVGVladimir Gurvich
- Martin MilaničMMMartin Milanič
- Mary ServatiusMSMary Servatius
- 1 March 2022
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 309, 285-300
Abstract
No abstract availableKeywords
Funding Information
- European Commission
- Deutscher Akademischer Austauschdienst (BI-DE/17-19-18)
- The Slovenian Research and Innovation Agency (BI-DE/19-20-04)
- The Slovenian Research and Innovation Agency (I0-0035)
- The Slovenian Research and Innovation Agency (J1-9110)
- The Slovenian Research and Innovation Agency (N1-0102)
- The Slovenian Research and Innovation Agency (N1-0160)
- European Social Fund Plus
This publication has 40 references indexed in Scilit:
- Shifting paths to avoidable onesJournal of Graph Theory, 2021
- Partial Characterizations of 1‐Perfectly Orientable GraphsJournal of Graph Theory, 2016
- Maximum Cardinality Search for Computing Minimal Triangulations of GraphsAlgorithmica, 2004
- Linear-Time Recognition of Circular-Arc GraphsAlgorithmica, 2003
- AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc GraphsJournal of Algorithms, 1997
- Generating weakly triangulated graphsJournal of Graph Theory, 1996
- In-Tournament DigraphsJournal of Combinatorial Theory, Series B, 1993
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphsJournal of Graph Theory, 1982
- Perfect Elimination and Chordal Bipartite GraphsJournal of Graph Theory, 1978
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961