324 results on '"Guantao Chen"'
Search Results
102. Degree-Light-Free Graphs and Hamiltonian Cycles.
103. Partitioning Vertices of a Tournament into Independent Cycles.
104. A note on Goldberg's conjecture on total chromatic numbers
105. 2-factors in claw-free graphs.
106. Clique covering the edges of a locally cobipartite graph.
107. Cycles in 2-Factors of Balanced Bipartite Graphs.
108. On 2-factors containing 1-factors in bipartite graphs.
109. Star-factors of tournaments.
110. Note on graphs without repeated cycle lengths.
111. Vertex colorings with a distance restriction.
112. Mixed Ramsey numbers: total chromatic number versus stars.
113. Intersections of Longest Cycles in k-Connected Graphs.
114. Tough enough chordal graphs are Hamiltonian.
115. Degree conditions for 2-factors.
116. Graphs with given odd sets.
117. Special monochromatic trees in two-colored complete graphs.
118. A special k-coloring for a connected k-chromatic graph.
119. A result on C4-star Ramsey numbers.
120. Degree Sum Conditions for Hamiltonicity on k-Partite Graphs.
121. A Class of Edge Critical 4-Chromatic Graphs.
122. A New Game Chromatic Number.
123. Essential independent sets and Hamiltonian cycles.
124. A partition approach to Vizing's conjecture.
125. Proof of a Conjecture of Bollob's on Nested Cycles.
126. The irredundant ramsey number s(3, 7).
127. Hamiltonicity for K1, r-free graphs.
128. Vertex disjoint cycles for star free graphs.
129. Hamiltonicity in balancedk-partite graphs.
130. Hamiltonian graphs with neighborhood intersections.
131. Neighborhood unions and the cycle cover number of a graph.
132. Graphs with a Cycle of Length Divisible by Three.
133. A note on fragile graphs.
134. Toughness of Ka,t-Minor-Free Graphs.
135. Asymptotic bounds for irredundant and mixed Ramsey numbers.
136. Hamiltonian graphs involving neighborhood intersections.
137. A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness.
138. Ramsey Problems With Bounded Degree Spread.
139. Graphs with Linearly Bounded Ramsey Numbers.
140. Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.
141. Hamiltonian graphs involving distances.
142. Overfullness of critical class 2 graphs with a small core degree
143. Improved bounds on the Ramsey number of fans
144. A Special Ancient Bronze Sword and Its Possible Manufacturing Technique from Materials Science Analysis
145. Saturation Numbers of Books.
146. Cyclopentadienyliron boronyl carbonyls as isoelectronic analogues of cyclopentadienylmanganese carbonyls except for boronyl ligand coupling reactions
147. One sufficient condition for hamiltonian graphs.
148. Characterization of [1, k]-Bar Visibility Trees.
149. New Conditions for k-ordered Hamiltonian Graphs.
150. Weak Clique-Covering Cycles and Paths.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.