Work

Optimal partition of a bipartite graph into non-crossing matchings

Year: 2001

Type: article

Source: Electronic Notes in Discrete Mathematics

DOI: 10.1016/s1571-0653(04)00390-7

Authors: Federico Malucelli, Sara Nicoloso

Institutions: Politecnico di Milano, Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W35934918

FWCI: 1.2

Cites: 2

Cited by: 3

Related to: 10