The following pages link to Shuya Chiba (Q322264):
Displayed 50 items.
- Vertex-disjoint subgraphs with high degree sums (Q322265) (← links)
- Dominating cycles and forbidden pairs containing \(P_5\) (Q343722) (← links)
- Circumferences of 2-factors in claw-free graphs (Q383757) (← links)
- Degree sum conditions for the circumference of 4-connected graphs (Q400404) (← links)
- Long cycles in unbalanced bipartite graphs (Q427825) (← links)
- Covers in 4-uniform intersecting families with covering number three (Q447816) (← links)
- 2-factors in claw-free graphs with lower bounds cycle lengths (Q489345) (← links)
- Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs (Q507484) (← links)
- Degree sum conditions for vertex-disjoint cycles passing through specified vertices (Q507488) (← links)
- Forbidden pairs with a common graph generating almost the same sets (Q528989) (← links)
- On a sharp degree sum condition for disjoint chorded cycles in graphs (Q604663) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- A degree sum condition for graphs to be covered by two cycles (Q973109) (← links)
- On degree sum conditions for 2-factors with a prescribed number of cycles (Q1660281) (← links)
- On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles (Q1689917) (← links)
- On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Covering vertices by a specified number of disjoint cycles, edges and isolated vertices (Q1928447) (← links)
- On degree sum conditions for directed path-factors with a specified number of paths (Q2005702) (← links)
- Induced nets and Hamiltonicity of claw-free graphs (Q2045363) (← links)
- Spanning bipartite graphs with large degree sum in graphs of odd order (Q2051889) (← links)
- Ramsey-type results for path covers and path partitions (Q2094874) (← links)
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs (Q2124605) (← links)
- Spanning bipartite graphs with high degree sum in graphs (Q2279986) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs (Q2404378) (← links)
- Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893) (← links)
- Forbidden pairs and the existence of a dominating cycle (Q2515588) (← links)
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs (Q2659232) (← links)
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles (Q2689639) (← links)
- (Q2829073) (← links)
- Disjoint Even Cycles Packing (Q2851449) (← links)
- (Q2857347) (← links)
- (Q2936733) (← links)
- A Relationship Between Thomassen's Conjecture and Bondy's Conjecture (Q3453562) (← links)
- (Q3515365) (← links)
- (Q3565870) (← links)
- On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs (Q4602862) (← links)
- Partitioning a graph into cycles with a specified number of chords (Q5066898) (← links)
- A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity (Q5210982) (← links)
- Remarks on upper and lower bounds formatching sequencibility of graphs (Q5279493) (← links)
- ${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski (Q5300486) (← links)
- On Dominating Even Subgraphs in Cubic Graphs (Q5346564) (← links)
- (Q5393539) (← links)
- A degree condition for cycles passing through specified vertices and edges (Q6056727) (← links)
- Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two (Q6074584) (← links)
- Ramsey-type results for path covers and path partitions. II: Digraphs (Q6096342) (← links)
- A supplement to "Induced nets and Hamiltonicity of claw-free graphs" (Q6299479) (← links)
- Minimum degree conditions for the existence of cycles of all lengths modulo $k$ in graphs (Q6316853) (← links)