Large regular graphs with no induced 2K_ 2

DOI10.1007/BF02350634zbMATH Open0764.05081MaRDI QIDQ1196569FDOQ1196569

William T. 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

networksbipartite graphextremal graphsregular graphsinterconnectionexcluded graphs

Mathematics Subject Classification ID

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

Cites Work

• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

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

Recommendations

• Sparse regular induced subgraphs in \(2P_3\)-free graphs 👍 👎
• Induced cycles in graphs 👍 👎
• Maximum hypergraphs without regular subgraphs 👍 👎
• Large \(2P_ 3\)-free graphs with bounded degree 👍 👎
• Triangle-free regular graphs 👍 👎

This page was built for publication: Large regular graphs with no induced \(2K_ 2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196569)