The following pages link to (Q3941433):
Displaying 50 items.
- On a class of kernel-perfect and kernel-perfect-critical graphs (Q685562) (← links)
- Connectivity of Kautz networks (Q685656) (← links)
- A note on partial Cayley graphs (Q685657) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- The decomposition of graphs into \(k\)-connected components (Q686294) (← links)
- Extending matchings in planar graphs. IV (Q686303) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- On existence theorems (Q686508) (← links)
- Shannon-like games are difficult (Q686516) (← links)
- Cycle structure of edge labelled graphs (Q686524) (← links)
- Bounds relating generalized domination parameters (Q687110) (← links)
- A characterization of intersection graphs of the maximal rectangles of a polyomino (Q687125) (← links)
- Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Strongly linear trend-free block designs and 1-factors of representative graphs (Q698023) (← links)
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (Q710720) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- Structurally fixed modes: Decomposition and reachability (Q752641) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- On domination and independent domination numbers of a graph (Q754234) (← links)
- On the relationship between the genus and the cardinality of the maximum matchings of a graph (Q755593) (← links)
- The continuous center set of a network (Q757234) (← links)
- Matching relations and the dimensional structure of social choices (Q760319) (← links)
- Connections in acyclic hypergraphs (Q762180) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Decomposition of large uniform hypergraphs (Q762500) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences (Q765379) (← links)
- A mathematical approach on representation of competitions: competition cluster hypergraphs (Q778654) (← links)
- More on limited packings in graphs (Q782753) (← links)
- On kernels and semikernels of digraphs (Q787155) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- Graph decompositions without isolates (Q790844) (← links)
- On a robustness property of PBIBD (Q792050) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- Chromatic number of classes of matrices of zeros and ones (Q794654) (← links)
- A geometric approach to forbidden minors for GF(3) (Q794659) (← links)
- NP-completeness of some problems of partitioning and covering in graphs (Q794673) (← links)
- Hamiltonian decompositions of complete graphs (Q795057) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- Graphs whose neighborhoods have no special cycles (Q798333) (← links)
- Geometrical solution of an intersection problem for two hypergraphs (Q798334) (← links)
- Tolerance graphs (Q798675) (← links)
- Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs (Q799693) (← links)
- Generation of trees of a graph with the use of decomposition (Q800368) (← links)
