1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2026
Cover numbers by graph families bounded by certain graph parameters
Anna Gujgiczer, Márton Marits, Kenta Ozeki
The cover number of a graph by a graph class is the least number of -graphs necessary to cover its edges. A classical theorem of Harary, Hsu and Miller giv…
math.CO2024
Cover numbers by certain graph families
Márton Marits
We define the cover number of a graph by a graph class as the minimum number of graphs of class required to cover the edge set of . Taking inspirat…
math.CO2024★ 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…