The following pages link to (Q3941433):
Displaying 50 items.
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- The intersection of all maximum stable sets of a tree and its pendant vertices (Q998466) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Milne's volume function and vector symmetric polynomials (Q1012153) (← links)
- Using stable sets to bound the chromatic number (Q1014408) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- The galaxies of nonstandard enlargements of infinite and transfinite graphs (Q1024447) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Inducing regulation of any digraphs (Q1028421) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number (Q1043938) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931) (← links)
- On intersection multigraphs of hypergraphs (Q1050366) (← links)
- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences (Q1050376) (← links)
- Partition of odd regular graphs into bistars (Q1052342) (← links)
- Perfectness and Dilworth number (Q1053715) (← links)
- Properties of (0,1)-matrices with no triangles (Q1054733) (← links)
- A class of matroids derived from saturated chain partitions of partially ordered sets (Q1054739) (← links)
- On matroids of the greatest W-connectivity (Q1054741) (← links)
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces (Q1056760) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- About some cyclic properties in digraphs (Q1058520) (← links)
- Long cycles in bipartite graphs (Q1059086) (← links)
- Matrices with forbidden subconfigurations (Q1059636) (← links)
- On the existence of acyclic views in a database scheme (Q1060030) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- On the chromatic number of certain highly symmetric graphs (Q1062067) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area (Q1064968) (← links)
- A note on total domination (Q1065020) (← links)
- A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles (Q1066157) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Structural consequences of individual position in nondyadic social networks (Q1068025) (← links)
- Good coverings of Hamming spaces with spheres (Q1068057) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- Every poset has a central element (Q1068859) (← links)
- A note on finding minimum cuts in directed planar networks by parallel computations (Q1069429) (← links)
- Uniquely solvable quadratic Boolean equations (Q1070255) (← links)
