Search

Your search keyword '"Edge-coloring"' showing total 397 results

Search Constraints

Start Over You searched for: Descriptor "Edge-coloring" Remove constraint Descriptor: "Edge-coloring"
397 results on '"Edge-coloring"'

Search Results

1. Edge-coloring of generalized lexicographic product of graphs

2. Compatible Spanning Circuits Visiting Each Vertex Exactly a Specified Number of Times in Graphs with Generalized Transition Systems.

3. SOME BOUNDS ON THE NUMBER OF COLORS IN INTERVAL EDGE-COLORINGS OF GRAPHS.

4. On improper interval colorings of complete multipartite graphs.

5. THE RAINBOW SATURATION NUMBER IS LINEAR.

6. Partition line graphs of multigraphs into two subgraphs with large chromatic numbers.

7. Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs.

8. Strong Edge Geodetic Problem on Complete Multipartite Graphs and Some Extremal Graphs for the Problem.

9. Tashkinov-Trees: An Annotated Proof.

10. Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs.

11. The Overfull Conjecture on split-comparability and split-interval graphs.

12. Bounds for the chromatic index of signed multigraphs.

13. Graphs, Disjoint Matchings and Some Inequalities.

14. (1, 2)-rainbow connection number at most 3 in connected dense graphs.

15. More on the Rainbow Disconnection in Graphs

16. Graphs with Strong Proper Connection Numbers and Large Cliques.

17. Orientation‐based edge‐colorings and linear arboricity of multigraphs.

18. Local Neighbor-Distinguishing Index of Graphs.

19. Rainbow trees in uniformly edge‐colored graphs.

20. A Characterization of Graphs with Small Palette Index.

21. Rainbow vertex pair-pancyclicity of strongly edge-colored graphs.

22. Graphs with large (1,2)-rainbow connection numbers.

24. MORE ON THE RAINBOW DISCONNECTION IN GRAPHS.

25. Complexity Results for the Proper Disconnection of Graphs

26. Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs.

27. Upper bounds on the number of colors in interval edge-colorings of graphs.

28. Graphs with Strong Proper Connection Numbers and Large Cliques

29. Note on Rainbow Triangles in Edge-Colored Graphs.

31. Bounds for the Rainbow Disconnection Numbers of Graphs.

32. A fast distributed algorithm for (Δ + 1)-edge-coloring.

33. Anti-Ramsey theory on complete bipartite graphs

34. Facial rainbow edge-coloring of simple 3-connected plane graphs

35. A Characterization of Graphs with Small Palette Index

36. AVD proper edge-coloring of some families of graphs

37. On Graphs with Proper Connection Number 2

38. The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves

39. The chromatic index of split-interval graphs.

40. Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph.

41. RAINBOW ERDŐOS--ROTHSCHILD PROBLEM FOR THE FANO PLANE.

42. Proper Disconnection of Graphs.

43. 单圈图的D(2)-点可区别边染色.

44. Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs

45. Facial [r,s,t]-Colorings of Plane Graphs

46. Conflict-free Connection Number and Independence Number of a Graph.

47. Conflict-Free Connections of Graphs

48. Homomorphisms of partial t-trees and edge-colorings of partial 3-trees.

49. Rearrangeable Nonblocking Conditions for Four Elastic Optical Data Center Networks.

50. Conflict-free connection number of random graphs.

Catalog

Books, media, physical & digital resources