Constructing trees in bipartite graphs

DOI10.1016/0012-365X(94)00335-GzbMath0855.05044WikidataQ126654441 ScholiaQ126654441MaRDI QIDQ1918569

U. Schulte

Publication date: 26 January 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treebipartite graphcoloringvertex partition

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (2)

A Unified Framework for Structured Graph Learning via Spectral Constraints ⋮ A sharp bound on the size of a connected matroid

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound on the Ramsey number of trees

This page was built for publication: Constructing trees in bipartite graphs