The following pages link to (Q3941433):
Displaying 50 items.
- Random partition models and complementary clustering of Anglo-Saxon place-names (Q262348) (← links)
- Disjoint Hamiltonian cycles in recursive circulant graphs (Q287012) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- On the number of spanning trees of multi-star related graphs (Q293235) (← links)
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- A formula for the number of spanning trees of a multi-star related graph (Q293471) (← links)
- On the number of spanning trees of a multi-complete/star related graph (Q294864) (← links)
- On the planarity of the \(k\)-zero-divisor hypergraphs (Q322007) (← links)
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques (Q324846) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Solving job shop problems in the context of hypergraphs (Q351548) (← links)
- Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (Q397162) (← links)
- Discovering a junction tree behind a Markov network by a greedy algorithm (Q402234) (← links)
- Independence densities of hypergraphs (Q402469) (← links)
- A degree condition for cycles of maximum length in bipartite digraphs (Q409445) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- A model of influence based on aggregation functions (Q459399) (← links)
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- Chromatic number and complete graph substructures for degree sequences (Q485549) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- A new property of the Lovász number and duality relations between graph parameters (Q516767) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- Hypergraphs and a functional equation of Bouwkamp and de Bruijn (Q556860) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Extending cycles in directed graphs (Q580359) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- On the power of concurrent-write PRAMs with read-only memory (Q582089) (← links)
- The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
- Flows in circulant graphs of odd order are sums of Hamilton cycles (Q583084) (← links)
- Gallai-type results for multiple boxes and forests (Q583206) (← links)
- The polytope of degree sequences (Q584289) (← links)
- Recognizing sign solvable graphs (Q585223) (← links)
- Superfluous paths in strong digraphs (Q594892) (← links)
- On several sorts of connectivity (Q594898) (← links)
- Matchings in benzene chains (Q594902) (← links)
- Mixed models, random utilities, and the triangle inequality (Q595587) (← links)
- Duality and perfection for edges in cliques (Q595674) (← links)
- Matchings and transversals in hypergraphs, domination and independence in trees (Q599067) (← links)
- Birth and growth of multicyclic components in random hypergraphs (Q604460) (← links)
- Optimal guard sets and the Helly property (Q607361) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- On arc reversal in balanced digraphs (Q626860) (← links)
- On parallel recognition of cographs (Q627166) (← links)
- Drawn \(k\)-in-a-row games (Q638520) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices (Q677122) (← links)
