Pages that link to "Item:Q1918569"

The following pages link to Constructing trees in bipartite graphs (Q1918569):

Displaying 12 items.

• Building graphs from colored trees (Q612947) (← links)
• Extremal theory and bipartite graph-tree Ramsey numbers (Q1112065) (← links)
• Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees (Q2118383) (← links)
• Graphs with at most two trees in a forest-building process (Q2424270) (← links)
• A sharp bound on the size of a connected matroid (Q2723463) (← links)
• CONSTRUCTING RED-BLACK TREE SHAPES (Q3021990) (← links)
• Constructing Trees in Graphs whose Complement has no <b><i>K</i></b>_{2,<b><i>s</i></b>} (Q3146982) (← links)
• Some complete bipartite graph-tree Ramsey numbers (Q3825106) (← links)
• Partitioning complete multipartite graphs by monochromatic trees (Q4667794) (← links)
• A Unified Framework for Structured Graph Learning via Spectral Constraints (Q4969059) (← links)
• Pure pairs. IV: Trees in bipartite graphs (Q6038584) (← links)