Pages that link to "Item:Q4962592"
From MaRDI portal
The following pages link to Distance Colouring Without One Cycle Length (Q4962592):
Displaying 5 items.
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- $t$-Strong Cliques and the Degree-Diameter Problem (Q5020846) (← links)
- Maximizing Line Subgraphs of Diameter at Most t (Q5071098) (← links)
