Pages that link to "Item:Q1164073"
From MaRDI portal
The following pages link to On a clique covering problem of Orlin (Q1164073):
Displaying 13 items.
- Duality and perfection for edges in cliques (Q595674) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- A simple lower bound on edge coverings by cliques (Q807634) (← links)
- Covering graphs by the minimum number of equivalence relations (Q1103644) (← links)
- Clique partitions and clique coverings (Q1124604) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- Biclique cover and local clique cover of graphs (Q1734028) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Avoiding exponential explosion in Petri net models of control flows (Q2165241) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Clique Partitions of Chordal Graphs (Q4290093) (← links)
- On Blocky Ranks Of Matrices (Q6489336) (← links)
