The following pages link to Tomás Feder (Q293381):
Displaying 26 items.
- (Q197726) (redirect page) (← links)
- Online channel allocation in FDMA networks with reuse constraints (Q293383) (← links)
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- The structure of bi-arc trees (Q864126) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (Q976091) (← links)
- On the graph turnpike problem (Q989483) (← links)
- Approximating the Minimum Chain Completion problem (Q989547) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- Matrix partitions with finitely many obstructions (Q1010616) (← links)
- (Q1028133) (redirect page) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- Bi‐arc graphs and the complexity of list homomorphisms (Q4798127) (← links)
- Stable networks and product graphs (Q4841789) (← links)
- (Q5089181) (← links)
- Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture (Q6055393) (← links)
- List homomorphism problems for signed trees (Q6340513) (← links)
- List homomorphisms to separable signed graphs (Q6439891) (← links)
