Pages that link to "Item:Q1103644"
From MaRDI portal
The following pages link to Covering graphs by the minimum number of equivalence relations (Q1103644):
Displayed 9 items.
- The equivalence number of a line graph (Q350825) (← links)
- Covering line graphs with equivalence relations (Q608272) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- A simple lower bound on edge coverings by cliques (Q807634) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- Graphs of small dimensions (Q1912752) (← links)
- On set intersection representations of graphs (Q3633007) (← links)