Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings

DOI10.1016/j.endm.2005.06.091zbMath1200.05176OpenAlexW2086313390MaRDI QIDQ3439389

Federico Malucelli, Sara Nicoloso

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.091

zbMATH Keywords

matchingcolouringbipartite graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Bounded ordered dictionaries in O(log log N) time and O(n) space
• Preserving order in a forest in less than logarithmic time and linear space
• Efficient labelling algorithms for the maximum noncrossing matching problem
• On the pagenumber of complete bipartite graphs
• Optimal partition of a bipartite graph into non-crossing matchings
• Pagenumber of complete bipartite graphs
• Graphs with E Edges Have Pagenumber O(√E)
• Degree constrained book embeddings

This page was built for publication: Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings