Restricted \(t\)-matchings in bipartite graphs (Q1410687): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncrossing a family of set-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal edge-coverings of pairs of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum square-free 2-matchings in bipartite graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00461-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973995785 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:35, 30 July 2024

scientific article
Language Label Description Also known as
English
Restricted \(t\)-matchings in bipartite graphs
scientific article

    Statements