Pages that link to "Item:Q912124"
From MaRDI portal
The following pages link to The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124):
Displaying 12 items.
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Colouring Squares of Claw-free Graphs (Q4625179) (← links)
- THE DOMINATION GAME ON SPLIT GRAPHS (Q4627573) (← links)
- Induced Turán Numbers (Q4643317) (← links)
- Edge maximal C_{2k+1}-edge disjoint free graphs (Q4647868) (← links)
- Maximizing Line Subgraphs of Diameter at Most t (Q5071098) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- The strong clique index of a graph with forbidden cycles (Q6056786) (← links)
- Strong edge-coloring of 2-degenerate graphs (Q6103470) (← links)
- Isolated Rupture in Composite Networks (Q6132390) (← links)
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs (Q6136471) (← links)
- Cliques in squares of graphs with maximum average degree less than 4 (Q6642507) (← links)