The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Paths in graphs, reducing the edge-connectivity only by two (Q1066914) (← links)
- Contact patterns of equal nonoverlapping spheres (Q1068097) (← links)
- On graphs with small subgraphs of large chromatic number (Q1068099) (← links)
- On the addressing problem for directed graphs (Q1068101) (← links)
- Degree sets of degree uniform graphs (Q1068111) (← links)
- On the regulation number of a multigraph (Q1068843) (← links)
- The spectrum of nested Steiner triple systems (Q1069945) (← links)
- A Ramsey-Sperner theorem (Q1070227) (← links)
- Maximal arcs in designs (Q1070234) (← links)
- Compatible additive permutations of finite integral bases (Q1071767) (← links)
- Symmetry and classification of certain regular group divisible designs (Q1071772) (← links)
- Hadamard graphs. I (Q1072573) (← links)
- Shuffles of permutations and the Kronecker product (Q1073034) (← links)
- A generalization of a theorem of Kruskal (Q1073037) (← links)
- The chromatic index of simple hypergraphs (Q1073804) (← links)
- Note on a Ramsey-Turán type problem (Q1073805) (← links)
- Coloring of universal graphs (Q1073812) (← links)
- Hadamard matrices generated by an adaptation of generalized quaternion type array (Q1074587) (← links)
- Uniqueness and nonexistence of some graphs related to \(M_{22}\) (Q1075337) (← links)
- How to find many counterfeit coins? (Q1076020) (← links)
- Monotone subsequences in (0,1)-matrices (Q1076026) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- Classification of 2-transitive symmetric designs (Q1076674) (← links)
- t-expansive and t-wise intersecting hypergraphs (Q1076693) (← links)
- A note on f-factors in directed and undirected multigraphs (Q1076696) (← links)
- A new construction for Williamson-type matrices (Q1077420) (← links)
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\) (Q1078149) (← links)
- Large triangle-free subgraphs in graphs without \(K_ 4\) (Q1078195) (← links)
- On component factors (Q1078207) (← links)
- Uniquely cocolourable graphs (Q1079577) (← links)
- On Hamilton decompositions of prisms over simple 3-polytopes (Q1079581) (← links)
- Generating and counting valid patterns in routes between two points (Q1080436) (← links)
- On orthogonal arrays of strength 3 and 5 achieving Rao's bound (Q1080855) (← links)
- Quick gossiping without duplicate transmissions (Q1080864) (← links)
- List-colourings of graphs (Q1084403) (← links)
- Holes in ordered sets (Q1084421) (← links)
- Rulers and slaves in a random social group (Q1085109) (← links)
- Hyperplane codes (Q1085139) (← links)
- Induced trees in sparse random graphs (Q1086255) (← links)
- Generalized van der Waerden numbers (Q1086281) (← links)
- Quadratic leaves of maximal partial triple systems (Q1086567) (← links)
- Characterization of partial 3-trees in terms of three structures (Q1086577) (← links)
- Hyperconnectivity of graphs (Q1086586) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- The binding number of line graphs and total graphs (Q1086594) (← links)
- On the number of faces of centrally-symmetric simplicial polytopes (Q1087139) (← links)
- On a construction of Thomassen (Q1087884) (← links)
- Linear upper bounds for local Ramsey numbers (Q1087887) (← links)
- Goodness of trees for generalized books (Q1087890) (← links)
- The classification of finite connected hypermetric spaces (Q1089011) (← links)
