Restricted Edge-colourings of Bipartite Graphs
From MaRDI portal
Publication:2785371
DOI10.1017/S0963548300002133zbMath0863.05039MaRDI QIDQ2785371
Publication date: 9 April 1997
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (4)
On the ascending subgraph decomposition problem for bipartite graphs ⋮ Some upper bounds on the total and list chromatic numbers of multigraphs ⋮ On star forest ascending subgraph decomposition ⋮ Short solution of Kotzig's problem for bipartite graphs
Cites Work
This page was built for publication: Restricted Edge-colourings of Bipartite Graphs
