The following pages link to Pavol Hell (Q338573):
Displaying 50 items.
- Broadcasting in one dimension (Q1113881) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- On generalized matching problems (Q1149783) (← links)
- Sparse broadcast graphs (Q1192945) (← links)
- Compatible 2-factors (Q1193724) (← links)
- Trahtenbrot-Zykov problem and NP-completeness (Q1201257) (← links)
- Achromatic numbers and graph operations (Q1201263) (← links)
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466) (← links)
- Universality of \(A\)-mote graphs (Q1209287) (← links)
- Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.) (Q1213889) (← links)
- On some strongly rigid families of graphs and the full embeddings they induce (Q1214943) (← links)
- Graph with given achromatic number (Q1233029) (← links)
- Homomorphisms of graphs and of their orientations (Q1245971) (← links)
- Graphs, networks and algorithms. Transl. from the 3rd German edition by Tilla Schade (Q1272253) (← links)
- Graph decomposition of slim graphs (Q1288512) (← links)
- Generalized octahedra and cliques in intersection graphs of uniform hypergraphs (Q1304822) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- Mutiplicativity of oriented cycles (Q1322018) (← links)
- On chordal proper circular arc graphs (Q1322203) (← links)
- Independence ratios of graph powers (Q1322230) (← links)
- Packing problems in edge-colored graphs (Q1331890) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- Antidirected Hamiltonian paths between specified vertices of a tournament (Q1348380) (← links)
- Homomorphisms to powers of digraphs (Q1349073) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Pairwise compatible Hamilton decompositions of \(K_n\) (Q1364230) (← links)
- \((a,b,k)\)-critical graphs (Q1375824) (← links)
- Optimal wavelength-routed multicasting (Q1392558) (← links)
- Relaxed coloring of a graph (Q1393026) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- On edge-sets of bicliques in graphs (Q1759846) (← links)
- Group weighted matchings in bipartite graphs (Q1804248) (← links)
- On circuit decomposition of planar Eulerian graphs (Q1814589) (← links)
- Partitioning chordal graphs into independent sets and cliques (Q1827861) (← links)
- Counterexamples to theorems of Menger type for the diameter (Q1838498) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← links)
- Polychromatic cliques (Q1877677) (← links)
- Equicovering matroids by distinct bases (Q1891366) (← links)
- On the ultimate independence ratio of a graph (Q1893949) (← links)
- Large planar graphs with given diameter and maximum degree (Q1897359) (← links)
- Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- Hom-properties are uniquely factorizable into irreducible factors (Q1970713) (← links)
- List homomorphisms and circular arc graphs (Q1977431) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Describing hereditary properties by forbidden circular orderings (Q2096309) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
