The following pages link to (Q5539649):
Displayed 13 items.
- Applications of edge coverings by cliques (Q762498) (← links)
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Trigraphs (Q1124613) (← links)
- Graphs which, with their complements, have certain clique covering numbers (Q1158174) (← links)
- Hajós' conjecture and small cycle double covers of planar graphs (Q1197036) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- Efficient algorithms for path partitions (Q1813975) (← links)
- On clique covers and independence numbers of graphs (Q1839263) (← links)
- Subgraph coverings and edge switchings (Q1850576) (← links)
- A note on biased and non-biased games (Q1894371) (← links)
- On the Decomposition of Graphs (Q3964612) (← links)