Large regular graphs with no induced \(2K_ 2\)

DOI10.1007/BF02350634zbMath0764.05081MaRDI QIDQ1196569

William T. jun. Trotter, Douglas B. West, G. W. Peck, Madeleine Paoli

Publication date: 16 January 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphnetworksextremal graphsregular graphsinterconnectionexcluded graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items

Nonempty intersection of longest paths in \(2K_2\)-free graphs, Maximum induced matchings in graphs, Bus interconnection networks, Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs, Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs, Cliques in \(C_4\)-free graphs of large minimum degree

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree