Matroidal bijections between graphs (Q2276983): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(88)90053-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2984474976 / rank | |||
Normal rank | |||
Revision as of 22:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matroidal bijections between graphs |
scientific article |
Statements
Matroidal bijections between graphs (English)
0 references
1988
0 references
The authors study 5 classes of bijections between the edge sets of two graphs, e.g. those induced by a homomorphism (called ``chromatic maps'') and those preserving cycles (called ``cyclic'' maps). All five conditions are quite natural when one considers graphs as binary matroids. These classes of map give rise to parameters of the graph G (e.g., chromatic maps lead to the well-known chromatic number) which are then studied in detail.
0 references
cycles
0 references
graphs
0 references
binary matroids
0 references
