30 citations · 157 across the 83 of their papers we have counts for
3 papers · 2 filters
Minor-Obstructions for Apex-Pseudoforests
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +2
A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one o…
A Menger-like property of tree-cut width
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond +1
In 1990, Thomas proved that every graph admits a tree decomposition of minimum width that additionally satisfies a certain vertex-connectivity condition called leanness [A Menger-l…
Structure and enumeration of K4-minor-free links and link-diagrams
Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona
We study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4.…