The following pages link to (Q4243804):
Displaying 30 items.
- On extremal \(k\)-supereulerian graphs (Q383349) (← links)
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs (Q400354) (← links)
- On 2-factors in claw-free graphs whose edges are in small cycles (Q456652) (← links)
- 2-factors with the bounded number of components in line graphs (Q628279) (← links)
- 2-factors and independent sets on claw-free graphs (Q658040) (← links)
- Minimum number of components of 2-factors in iterated line graphs (Q726529) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- An improved degree based condition for Hamiltonian cycles (Q845978) (← links)
- Closure concept for 2-factors in claw-free graphs (Q968436) (← links)
- Computing sharp 2-factors in claw-free graphs (Q988693) (← links)
- The structure of even factors in claw-free graphs (Q1025500) (← links)
- Closure, stability and iterated line graphs with a 2-factor (Q1044973) (← links)
- The S\(^2\)NS digraphs and the cycle linear system of a digraph (Q1862950) (← links)
- On factor-invariant graphs with two cycles (Q2142673) (← links)
- On the 2-factor index of a graph (Q2455573) (← links)
- Even subgraphs of bridgeless graphs and 2-factors of line graphs (Q2461204) (← links)
- On the number of components in 2-factors of claw-free graphs (Q2461206) (← links)
- 2-factors with bounded number of components in claw-free graphs (Q2514163) (← links)
- Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs (Q2935362) (← links)
- 2-Factors in claw-free graphs with locally disconnected vertices (Q2947989) (← links)
- The upper bound of the number of cycles in a 2-factor of a line graph (Q3445503) (← links)
- On components of 2-factors in claw-free graphs (Q3503486) (← links)
- (Q3513054) (← links)
- Computing Sharp 2-Factors in Claw-Free Graphs (Q3599127) (← links)
- (Q4243050) (← links)
- (Q4622612) (← links)
- Two operations on a graph preserving the (non)existence of 2-factors in its line graph (Q5249638) (← links)
- (Q5477383) (← links)
- Forbidden pairs of disconnected graphs for 2‐factor of connected graphs (Q6081558) (← links)
- On 2-factors with a specified number of components in line graphs (Q6621179) (← links)
