On the fg-coloring of graphs (Q2277478): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:18, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the fg-coloring of graphs |
scientific article |
Statements
On the fg-coloring of graphs (English)
0 references
1990
0 references
In this paper multigraphs \(G=(V,E)\) without loops are under consideration. They are assigned edge colourings satisfying the following two conditions: (i) Each colour appears at each vertex v no more than f(v) times. (ii) Each colour appears at each set of multiple edges joining vertices v and w no more than g(vw) times. These edge colourings are called fg-colourings. \(q^*_{fg}(G)\) denotes the minimum number of colours needed to fg-colour a multigraph G. Various upper bounds on \(g^*_{fg}(G)\) are given. The main result is \[ q^*_{fg}(G)\leq \max_{vw\in G}\lceil d(v)/f(v)+p(vw)/g(vw)\rceil. \] A polynomial time algorithm to fg-colour a given multigraph using \(\leq 2q^*_{fg}(G)\) colours is presented.
0 references
fg-chromatic index
0 references
multigraphs
0 references
edge colourings
0 references
fg-colourings
0 references
polynomial time algorithm
0 references