1,185 results on '"Dvořák, Zdeněk"'
Search Results
52. Flexibility of triangle-free planar graphs
53. Baker game and polynomial-time approximation schemes
54. 1-subdivisions, fractional chromatic number and Hall ratio
55. Model of Resilience Assessment of Electricity Infrastructure
56. Resilience as a Feature of Intelligent Railway Infrastructure
57. Dinuclear doubly bridged phenoxido copper(II) complexes as efficient anticancer agents
58. Additive non-approximability of chromatic number in proper minor-closed classes
59. Vulnerability of the Infrastructure: Risk Management and Implementation of the Information Systems
60. Gold(I) N-Heterocyclic Carbene Complexes with 7-Azaindoles Demonstrates In Vitro Antiproliferative Effects on Ovarian Cancer Cells and Anti-inflammatory Activity
61. Epithelioid Soft Tissue Neoplasm of the Soft Palate with a PTCH1-GLI1 Fusion: A Case Report and Review of the Literature
62. Fractional coloring of planar graphs of girth five
63. A $4$-choosable graph that is not $(8:2)$-choosable
64. (3a:a)-list-colorability of embedded graphs of girth at least five
65. Single-conflict colouring
66. Structure and generation of crossing-critical graphs
67. Planar graphs without cycles of length 4 or 5 are (11:3)-colorable
68. Irreducible 4-critical triangle-free toroidal graphs
69. On generalized choice and coloring numbers
70. New glycoconjugation strategies for Ruthenium(II) arene complexes via phosphane ligands and assessment of their antiproliferative activity
71. Characterization of 4-critical triangle-free toroidal graphs
72. Rare syringoid eccrine carcinoma of the upper lip and nasal base treated with resection and subsequent innovative reconstruction using an Abbé flap, turbinate flaps and three-stage forehead flap: a case report
73. On distance r-dominating and 2r-independent sets in sparse graphs
74. On classes of graphs with strongly sublinear separators
75. Islands in minor-closed classes. I. Bounded treewidth and separators
76. Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs
77. Exponentially many nowhere-zero $Z_3$-, $Z_4$-, and $Z_6$-flows
78. Additive non-approximability of chromatic number in proper minor-closed classes
79. Induced subdivisions and bounded expansion
80. Triangle-free graphs of tree-width t are ceil((t + 3)/2)-colorable
81. Thin graph classes and polynomial-time approximation schemes
82. Triangle-free planar graphs with small independence number
83. Do triangle-free planar graphs have exponentially many 3-colorings?
84. Structurally diverse zinc(II) complexes containing tripodal tetradentate phenoxido-amines with promising antiproliferative effects.
85. List coloring with requests
86. Interval Representation of Balanced Separators in Graphs Avoiding a Minor
87. Notes on Graph Product Structure Theory
88. Heteroleptic copper(II) complexes of prenylated flavonoid osajin behave as selective and effective antiproliferative and anti-inflammatory agents
89. Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
90. Jasmone, an essential oil component, is an antagonist of aryl hydrocarbon receptor in liver and intestinal cells
91. Gold(I) N‐heterocyclic carbene (NHC) complexes containing 6‐mercaptopurine derivatives and their in vitro anticancer and anti‐inflammatory effects
92. Criticality Assessment of Railway Bridges
93. Organization of Damaged Road Rehabilitation in the Village of Rybany
94. Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
95. Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
96. Independent sets near the lower bound in bounded degree graphs
97. Graphic TSP in cubic graphs
98. Triangle-free planar graphs with the smallest independence number
99. Cyclic Coloring of Plane Graphs with Maximum Face Size 16 and 17
100. Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.