Pages that link to "Item:Q1299990"
From MaRDI portal
The following pages link to Bipartite subgraphs of graphs with maximum degree three (Q1299990):
Displaying 8 items.
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Large \(2P_ 3\)-free graphs with bounded degree (Q1916098) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (Q2011157) (← links)
- Concatenating bipartite graphs (Q2144334) (← links)
- Extremal connectivity for topological cliques in bipartite graphs (Q2581501) (← links)
- (Q3621537) (← links)
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three (Q3749084) (← links)