Result 1 to 5 from 5 total
On the maximum number of unit edges in $K_{m,n}$. (English)
Congr. Numerantium 142, 49-56 (2000).
1
Vertex-distinguishing proper edge-colorings. (English)
J. Graph Theory 26, No.2, 73-82 (1997).
2
The path length sequence of $K_{m,n}$ and other triangle-free graphs. (English)
Congr. Numerantium 118, 117-126 (1996).
3
The irregular coloring number of a tree. (English)
Discrete Math. 141, No.1-3, 279-283 (1995).
4
On graphs with irregular coloring number $2$. (English)
Congr. Numerantium 100, 129-140 (1994).
5
Result 1 to 5 from 5 total
Start
Contact
Print
General Help
