The chromatic index of nearly bipartite multigraphs (Q1076034)
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: The chromatic index of nearly bipartite multigraphs |
scientific article; zbMATH DE number 3952797
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromatic index of nearly bipartite multigraphs |
scientific article; zbMATH DE number 3952797 |
Statements
The chromatic index of nearly bipartite multigraphs (English)
0 references
1986
0 references
König's theorem states that if M is a bipartite multigraph with maximal valency \(\Delta\) (M) then the chromatic index \(\chi\) '(M) equals \(\Delta\) (M). A multigraph is called nearly bipartite if it is not bipartite but contains a vertex whose deletion yields a bipartite multigraph. The aim of this paper is to give a formula for \(\chi\) '(M) where M is nearly bipartite.
0 references
bipartite multigraph
0 references
chromatic index
0 references
nearly bipartite
0 references
