Edge covering coloring of nearly bipartite graphs (Q854458)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Edge covering coloring of nearly bipartite graphs
scientific article

    Statements

    Edge covering coloring of nearly bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2006
    0 references
    This paper presents some sufficient conditions for a nearly bipartite graph having as its edge covering chromatic number the minimum degree of vertices.
    0 references
    0 references
    edge covering chromatic number
    0 references

    Identifiers