ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS (Q4903635): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized subgraph-restricted matchings in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bandwidth of chain graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Node-Deletion NP-Complete Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bipartite permutation graphs with application to the minimum buffer size problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bipartite permutation graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank | |||
Normal rank | |||
Latest revision as of 03:42, 6 July 2024
scientific article; zbMATH DE number 6128408
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS |
scientific article; zbMATH DE number 6128408 |
Statements
ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS (English)
0 references
24 January 2013
0 references
graph algorithms
0 references
acyclic matching
0 references
chain graphs
0 references
bipartite permutation graphs
0 references
perfect elimination bipartite graphs
0 references
NP-complete
0 references
