1 problem
Matching
Let be a connected hypergraph. It is -degenerated if every subhypergraph of has a vertex of degree at most . A hypergraph is -cordial when a labeling of its vertic…
Let be a connected hypergraph. It is -degenerated if every subhypergraph of has a vertex of degree at most . A hypergraph is -cordial when a labeling of its vertic…