A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices (Q3637073)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices |
scientific article |
Statements
A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices (English)
0 references
7 July 2009
0 references
matching forcing number
0 references
trailing vertices
0 references
trailing-vertex method
0 references
bipartite graphs
0 references
