Pages that link to "Item:Q3340897"
From MaRDI portal
The following pages link to Clique Covering of Graphs IV. Algorithms (Q3340897):
Displayed 11 items.
- Induced cycles in triangle graphs (Q298987) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- The clique-partitioning problem (Q807637) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- ℱ-WORM colorings of some 2-trees: partition vectors (Q5225032) (← links)