User Guide
Why can I only view 3 results?
You can also view all results when you are connected from the network of member institutions only. For non-member institutions, we are opening a 1-month free trial version if institution officials apply.
So many results that aren't mine?
References in many bibliographies are sometimes referred to as "Surname, I", so the citations of academics whose Surname and initials are the same may occasionally interfere. This problem is often the case with citation indexes all over the world.
How can I see only citations to my article?
After searching the name of your article, you can see the references to the article you selected as soon as you click on the details section.
 Views 6
On the upper chromatic index of a multigraph
2002
Journal:  
Computer Science Journal of Moldova
Author:  
Abstract:

We consider the colorings of the edges of a multigraph in such a way that every non-pendant vertex is incident to at least two edges of the same color. The maximum number of colors that can be used in such colorings is the upper chromatic index of a multigraph G, denoted by not(χ')(G). We prove that if a multigraph G has n vertices, m edges, p pendant vertices and maximum number c disjoint cycles, then not(χ')(G) = c + m - n + p

Keywords:

Citation Owners
Information: There is no ciation to this publication.
Similar Articles












Computer Science Journal of Moldova

Field :   Fen Bilimleri ve Matematik

Journal Type :   Uluslararası

Metrics
Article : 627
Cite : 3.639
Computer Science Journal of Moldova