Matroidal bijections between graphs (Q2276983): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Roy Meshulam / rank | |||
Property / reviewed by | |||
Property / reviewed by: Dieter Jungnickel / rank | |||
Property / author | |||
Property / author: Roy Meshulam / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Dieter Jungnickel / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Q5668821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686719 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orientability of matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds for constant weight codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4129487 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3710541 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semi-duality and the cycle double cover conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:31, 21 June 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