Showing math.COShow all
3 papers · 1 filter
math.CO2026
Unit distance graphs with few crossings per edge
Panna Gehér, Dömötör Pálvölgyi, Dániel G. Simon +1
A graph is called a -planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most crossings. We investig…
math.CO2026★ 1 cited
Partitioning perfect graphs into comparability graphs
András Gyárfás, Márton Marits, Géza Tóth
We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two…
math.CO2025
Matchings avoiding ordered patterns
János Barát, Andrea Freschi, Géza Tóth
A {\it vertex-ordered} graph is a graph equipped with a linear ordering of its vertices. A pair of independent edges in an ordered graph can exhibit one of the following three patt…