114 results on '"Roman Soták"'
Search Results
2. Revisiting semistrong edge-coloring of graphs.
3. Degree-balanced decompositions of cubic graphs.
4. Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods.
5. Locally irregular edge-coloring of subcubic graphs.
6. Interval vertex coloring.
7. Strong edge colorings of graphs and the covers of Kneser graphs.
8. Structure of edges of embedded graphs with minimum degree two.
9. Long cycles and spanning subgraphs of locally maximal 1-planar graphs.
10. Incidence coloring-cold cases.
11. On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}.
12. Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods.
13. Revisiting Semistrong Edge-Coloring of Graphs.
14. Locally irregular edge-coloring of subcubic graphs.
15. Light 3-stars in embedded graphs.
16. Note on list star edge-coloring of subcubic graphs.
17. Facial incidence colorings of embedded multigraphs.
18. Note on 3-choosability of planar graphs with maximum degree 4.
19. New bounds for locally irregular chromatic index of bipartite and subcubic graphs.
20. Facial anagram-free edge-coloring of plane graphs.
21. On a star chromatic index of subcubic graphs.
22. Note on incidence chromatic number of subquartic graphs.
23. From NMNR-coloring of hypergraphs to homogenous coloring of graphs.
24. On the cyclic coloring conjecture.
25. Structure of edges in plane graphs with bounded dual edge weight.
26. Star edge-coloring of square grids.
27. Star Edge Coloring of Some Classes of Graphs.
28. 3-path in graphs with bounded average degree.
29. Optimal unavoidable sets of types of 3-paths for planar graphs of given girth.
30. A note on adjacent vertex distinguishing colorings of graphs.
31. On incidence coloring conjecture in Cartesian products of graphs.
32. Rainbow Numbers for Cycles in Plane Triangulations.
33. Generalized fractional and circular total colorings of graphs.
34. Generalized fractional total colorings of graphs.
35. Note on 3-paths in plane graphs of girth 4.
36. l-facial edge colorings of graphs.
37. Fractional and circular 1-defective colorings of outerplanar graphs.
38. Rainbow Numbers for Graphs Containing Small Cycles.
39. A note on vertex colorings of plane graphs.
40. Strong edge-coloring of planar graphs.
41. Note on coloring of double disk graphs.
42. Arbitrarily large difference between dd-strong chromatic index and its trivial lower bound.
43. Facial parity edge colouring of plane pseudographs.
44. Acyclic edge coloring of planar graphs with Δ colors.
45. Facial non-repetitive edge-coloring of plane graphs.
46. Generalized circular colouring of graphs.
47. General neighbour-distinguishing index via chromatic number.
48. On large light graphs in families of polyhedral graphs.
49. Total edge irregularity strength of complete graphs and complete bipartite graphs.
50. Rainbow faces in edge-colored plane graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.