Results 101 to 110 of about 3,724 (174)
Discussiones Mathematicae Graph Theory, 2018 Let 𝒫 be an arbitrary class of graphs that is closed under taking induced subgraphs and let 𝒞 (𝒫) be the family of forbidden subgraphs for 𝒫. We investigate the class 𝒫 (k) consisting of all the graphs G for which the removal of no more than k vertices ...
Borowiecki Mieczysław +2 more
doaj +1 more source
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
Odd 4-Coloring of Outerplanar Graphs
Graphs and CombinatoricsA proper $k$-coloring of $G$ is called an odd coloring of $G$ if for every vertex $v$, there is a color that appears at an odd number of neighbors of $v$. This concept was introduced recently by Petruševski and Škrekovski, and they conjectured that every planar graph is odd 5-colorable.
Kashima, Masaki, Zhu, Xuding
openaire +2 more sources
Definability Equals Recognizability for $k$-Outerplanar Graphs
, 2015 40 pages, 8 ...
Jaffke, Lars, Bodlaender, Hans L.
openaire +7 more sources
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful +2 more
openaire +2 more sources
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Mitochondrial networks through the lens of mathematics. [PDF]
Phys Biol, 2023 Lewis GR, Marshall WF.
europepmc +1 more source
Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]
Discrete Mathematics Letters, 2023 Július Czap
doaj +1 more source
Unsplittable Multicommodity Flows in Outerplanar Graphs
Full version of IPCO 2025 ...
David Alemán-Espinosa, Nikhil Kumar
openaire +2 more sources
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source