7 papers · 1 filter
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…
Domination and packing in graphs
Ákos Dúcz, Anna Gujgiczer
The dominating number of a graph is the minimum size of a vertex set whose closed neighborhoods cover all vertices of , while the packing number is the maximum…
On graph classes with constant domination-packing ratio
Marthe Bonamy, Mónika Csikós, Anna Gujgiczer +1
The dominating number of a graph is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number of is…
Winding number and circular 4-coloring of signed graphs
Anna Gujgiczer, Reza Naserasr, Rohini S +1
Concerning the recent notion of circular chromatic number of signed graphs, for each given integer we introduce two signed bipartite graphs, each on vertices, having…
Critical subgraphs of Schrijver graphs for the fractional chromatic number
Anna Gujgiczer, Gábor Simonyi
Schrijver graphs are vertex-color-critical subgraphs of Kneser graphs having the same chromatic number. They also share the value of their fractional chromatic number but Schrijver…
Structured Codes of Graphs
Noga Alon, Anna Gujgiczer, János Körner +2
We investigate the maximum size of graph families on a common vertex set of cardinality such that the symmetric difference of the edge sets of any two members of the family sat…
On multichromatic numbers of widely colorable graphs
Anna Gujgiczer, Gábor Simonyi
A coloring is called -wide if no walk of length connects vertices of the same color. A graph is -widely colorable with colors if and only if it admits a homomorphi…