From the 1 of 3 linked papers with an AI index.
3 papers
math.CO2026
Feedback vertex sets of planar digraphs with fixed digirth
Simon Dreyer, Alexandre Pinlou, Petru Valicov
The paper studies the size of minimum feedback vertex sets in planar directed graphs with a fixed digirth, establishing new upper and lower bounds and presenting constructions that…
math.CO2025
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
Stijn Cambie, François Dross, Kolja Knauer +2
A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyc…
math.CO2025
Largest planar graphs of diameter and fixed maximum degree -- connection with fractional matchings
Antoine Dailly, Sasha Darmon, Ugo Giocanti +2
The degree diameter problem asks for the maximum possible number of vertices in a graph of maximum degree and diameter . In this paper, we focus on planar graphs of diamete…