The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
From MaRDI portal
Publication:912124
DOI10.1016/0012-365X(90)90144-7zbMath0698.05039OpenAlexW2119003746WikidataQ127673847 ScholiaQ127673847MaRDI QIDQ912124
András Gyárfás, William T. jun. Trotter, Zsolt Tuza, Fan R. K. Chung
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90144-7
Related Items
Triangle-free graphs and forbidden subgraphs, Strong edge coloring of circle graphs, Clique number of the square of a line graph, Dominating subgraphs in graphs with some forbidden structures, On the chromatic number of \(2 K_2\)-free graphs, The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs, Nonempty intersection of longest paths in \(2K_2\)-free graphs, Induced Separation Dimension, A bound on the strong chromatic index of a graph, A stronger bound for the strong chromatic index (extended abstract), Maximum induced matchings in graphs, Maximizing Line Subgraphs of Diameter at Most t, Characterization of graphs dominated by induced paths, Large \(2P_ 3\)-free graphs with bounded degree, Bus interconnection networks, Strong chromatic index of graphs with maximum degree four, Powers of edge ideals with linear resolutions, Characterization of \(P_{6}\)-free graphs, Induced matchings in subcubic graphs without short cycles, Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs, The strong clique index of a graph with forbidden cycles, Colouring squares of claw-free graphs, Strong edge-coloring of 2-degenerate graphs, Isolated Rupture in Composite Networks, Coloring of a superclass of \(2K_2\)-free graphs, Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs, A Stronger Bound for the Strong Chromatic Index, Strong edge-coloring of graphs with maximum degree 4 using 22 colors, Locally searching for large induced matchings, Colouring of \((P_3 \cup P_2)\)-free graphs, Distance-two coloring of sparse graphs, On strong edge-colouring of subcubic graphs, Colouring Squares of Claw-free Graphs, THE DOMINATION GAME ON SPLIT GRAPHS, Dominating cliques in \(P_ 5\)-free graphs, A note on the strong chromatic index of bipartite graphs, Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs, Strong edge-colorings for \(k\)-degenerate graphs, Cops and robbers on \(2K_2\)-free graphs, Induced Turán Numbers, Large regular graphs with no induced \(2K_ 2\), On small graphs with highly imperfect powers, On induced matchings, Cliques in \(C_4\)-free graphs of large minimum degree, The strong chromatic index of a cubic graph is at most 10, The existence and upper bound for two types of restricted connectivity, Infinite versus finite graph domination, The induced separation dimension of a graph, Sparse regular induced subgraphs in \(2P_3\)-free graphs, Strong cliques in claw-free graphs, Complete description of forbidden subgraphs in the structural domination problem, Weighted coloring on planar, bipartite and split graphs: Complexity and approximation, Strong Chromatic Index of Sparse Graphs, Strong chromatic index of \(K_{1, t}\)-free graphs, Recent progress on strong edge-coloring of graphs, From edge-coloring to strong edge-coloring, On the computational complexity of strong edge coloring, Strong edge coloring of Cayley graphs and some product graphs, Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
Cites Work
