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):
Displayed 16 items.
- On induced matchings (Q687143) (← links)
- Characterization of graphs dominated by induced paths (Q868348) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- Large regular graphs with no induced \(2K_ 2\) (Q1196569) (← links)
- On small graphs with highly imperfect powers (Q1198509) (← links)
- The strong chromatic index of a cubic graph is at most 10 (Q1201255) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- Maximum induced matchings in graphs (Q1363677) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
- Large \(2P_ 3\)-free graphs with bounded degree (Q1916098) (← links)
- Bus interconnection networks (Q1917343) (← links)
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734) (← links)