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 50 items.
- Clique number of the square of a line graph (Q271628) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← links)
- Cliques in \(C_4\)-free graphs of large minimum degree (Q524175) (← links)
- On induced matchings (Q687143) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← 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)
- The existence and upper bound for two types of restricted connectivity (Q968169) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← 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)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Nonempty intersection of longest paths in \(2K_2\)-free graphs (Q1640209) (← links)
- Strong chromatic index of graphs with maximum degree four (Q1671652) (← links)
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs (Q1684926) (← links)
- Colouring squares of claw-free graphs (Q1689990) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- Large \(2P_ 3\)-free graphs with bounded degree (Q1916098) (← links)
- Bus interconnection networks (Q1917343) (← links)
- Strong cliques in claw-free graphs (Q2053719) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs (Q2118240) (← links)
- Strong edge coloring of circle graphs (Q2122690) (← links)
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs (Q2144507) (← links)
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs (Q2227834) (← links)
- Cops and robbers on \(2K_2\)-free graphs (Q2237234) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- On strong edge-colouring of subcubic graphs (Q2444538) (← links)
- Strong Chromatic Index of Sparse Graphs (Q2833251) (← links)
- Induced Separation Dimension (Q3181052) (← links)
- Powers of edge ideals with linear resolutions (Q4576722) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Colouring Squares of Claw-free Graphs (Q4625179) (← links)
