Pages that link to "Item:Q2483388"
From MaRDI portal
The following pages link to Clique coverings and partitions of line graphs (Q2483388):
Displaying 11 items.
- The equivalence number of a line graph (Q350825) (← links)
- Graph partition into small cliques (Q741755) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- On the number of distinct minimal clique partitions and clique covers of a line graph (Q1813995) (← links)
- Upper bounds for the rainbow connection numbers of line graphs (Q1926059) (← links)
- Eigenvalues and clique partitions of graphs (Q2040995) (← links)
- Linear operators on graphs that preserve the clique cover number (Q2799863) (← links)
- (Q3797236) (← links)
- Edge clique cover of claw‐free graphs (Q4629999) (← links)
- Topology of clique complexes of line graphs (Q5045261) (← links)