Pages that link to "Item:Q1839263"
From MaRDI portal
The following pages link to On clique covers and independence numbers of graphs (Q1839263):
Displaying 7 items.
- Duality and perfection for edges in cliques (Q595674) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- Maximum set of edges no two covered by a clique (Q1084407) (← links)
- Coherent network partitions (Q2026346) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
