Pages that link to "Item:Q1343162"
From MaRDI portal
The following pages link to Clique covering and clique partition in generalizations of line graphs (Q1343162):
Displaying 8 items.
- A polynomial algorithm for constructing the clique graph of a line graph (Q1075338) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- On the number of distinct minimal clique partitions and clique covers of a line graph (Q1813995) (← links)
- Methods of finding all minimum coverings of a graph by cliques (Q1903945) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- Clique coverings and partitions of line graphs (Q2483388) (← links)
- Linear operators on graphs that preserve the clique cover number (Q2799863) (← links)
- (Q3797236) (← links)