The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Spanning trees: A survey (Q659663) (← links)
- Ramsey numbers of some bipartite graphs versus complete graphs (Q659665) (← links)
- A note on Lights-Out-puzzle: parity-state graphs (Q659666) (← links)
- Random planar graphs with bounds on the maximum and minimum degrees (Q659667) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Looseness of plane graphs (Q659673) (← links)
- The \(p\)-bondage number of trees (Q659674) (← links)
- Algebraic connectivity of connected graphs with fixed number of pendant vertices (Q659677) (← links)
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (Q659679) (← links)
- Almost resolvable maximum packings of complete graphs with 4-cycles (Q659680) (← links)
- Superconnected and hyperconnected small degree transitive graphs (Q659681) (← links)
- Properly edge-coloured subgraphs in colourings of bounded degree (Q659683) (← links)
- The \(k\)-restricted edge connectivity of balanced bipartite graphs (Q659684) (← links)
- Cleaning with brooms (Q659685) (← links)
- On 3-edge-connected supereulerian graphs (Q659686) (← links)
- On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs (Q659687) (← links)
- A note on group choosability of graphs with girth at least 4 (Q659688) (← links)
- Comparison of two techniques for proving nonexistence of strongly regular graphs (Q659689) (← links)
- Automorphic decompositions of graphs (Q659690) (← links)
- The number of independent sets in a graph with small maximum degree (Q659691) (← links)
- Infinitely many hypohamiltonian cubic graphs of girth 7 (Q659692) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Cutting a convex polyhedron out of a sphere (Q659695) (← links)
- Maximum eigenvalue problem for Escherization (Q659697) (← links)
- On the structure of graphs with low obstacle number (Q659699) (← links)
- Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\) (Q659700) (← links)
- A note on the complexity of real algebraic hypersurfaces (Q659701) (← links)
- (Non)Existence of pleated folds: How paper folds between creases (Q659705) (← links)
- Colorful strips (Q659707) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- Continuous blooming of convex polyhedra (Q659710) (← links)
- Classification of the congruent embeddings of a tetrahedron into a triangular prism (Q659711) (← links)
- Spanning \(k\)-trees of \(n\)-connected graphs (Q659713) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Lattice points on similar figures and conics (Q659715) (← links)
- Forbiddance and capacity (Q659716) (← links)
- Higher dimensional Moore bounds (Q659717) (← links)
- Metric dimension and \(R\)-sets of connected graphs (Q659718) (← links)
- On the Roman bondage number of planar graphs (Q659719) (← links)
- Characterizations of bent and almost bent function on \({\mathbb{Z}}_p^2\) (Q659720) (← links)
- The spectrum of tetrahedral quadruple systems (Q659721) (← links)
- The cycle switching graph of the Steiner triple systems of order 19 is connected (Q659722) (← links)
- Pairs of chromatically equivalent graphs (Q659723) (← links)
- Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
- On the range of possible integrities of graphs \(G(n, k)\) (Q659726) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- Color chain of a graph (Q659728) (← links)
- On idomatic partitions of direct products of complete graphs (Q659730) (← links)
