The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076) (← links)
- Super-simple resolvable balanced incomplete block designs with block size 4 and index 4 (Q367079) (← links)
- Homomorphism bounds for oriented planar graphs of given minimum girth (Q367080) (← links)
- Laplacian spectral radius and maximum degree of trees with perfect matchings (Q367081) (← links)
- The existence of augmented resolvable candelabra quadruple systems with three even groups (Q367083) (← links)
- Neighborhood unions for the existence of disjoint chorded cycles in graphs (Q367086) (← links)
- A note on Turán numbers for even wheels (Q367087) (← links)
- An implicit degree condition for pancyclicity of graphs (Q367090) (← links)
- The existence of \((K_2\times K_6)\)-designs (Q367091) (← links)
- A contribution to the second neighborhood problem (Q367093) (← links)
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- A study of monopolies in graphs (Q367095) (← links)
- Advanced lower bounds for the circumference (Q367097) (← links)
- Forbidden configurations and product constructions (Q489298) (← links)
- Steiner triple systems, pinched surfaces, and complete multigraphs (Q489300) (← links)
- Rainbow connection number of graph power and graph products (Q489302) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- Simultaneous domination in graphs (Q489305) (← links)
- Connector families of graphs (Q489306) (← links)
- Counting lattice paths with four types of steps (Q489308) (← links)
- Characterizations of strength extremal graphs (Q489310) (← links)
- Note on Enomoto and Ota's conjecture for short paths in large graphs (Q489313) (← links)
- Edge-distinguishing index of a graph (Q489314) (← links)
- A decomposition theorem for binary matroids with no prism minor (Q489315) (← links)
- Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs (Q489317) (← links)
- An action of the tetrahedron algebra on the standard module for the Hamming graphs and Doob graphs (Q489319) (← links)
- Some families of directed strongly regular graphs obtained from certain finite incidence structures (Q489322) (← links)
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph (Q489324) (← links)
- Hamiltonian cycles and symmetric chains in Boolean lattices. (Q489325) (← links)
- Abelian Cayley graphs of given degree and diameter 2 and 3 (Q489326) (← links)
- Indistinguishable trees and graphs (Q489327) (← links)
- Contractible edges in \(k\)-connected graphs with some forbidden subgraphs (Q489329) (← links)
- Graphic sequences with an \(A\)-connected realization (Q489330) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Cacti whose spread is maximal (Q489338) (← links)
- Parity-constrained triangulations with Steiner points (Q489340) (← links)
- Spectral characterization of families of split graphs (Q489341) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- On weak chromatic polynomials of mixed graphs (Q489344) (← links)
- 2-factors in claw-free graphs with lower bounds cycle lengths (Q489345) (← links)
- On panchromatic digraphs and the panchromatic number (Q489347) (← links)
- Symmetric difference-free and symmetric difference-closed collections of sets (Q489349) (← links)
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- Rainbow connection number and the number of blocks (Q489352) (← links)
- New classes of extremal graphs with given bandwidth (Q489353) (← links)
- The largest demigenus over all signatures on \(K_{3,n}\) (Q489355) (← links)
- Vertex and edge dimension of hypergraphs (Q489357) (← links)
- Transitions of hexangulations on the sphere (Q489358) (← links)
- On traceable line graphs (Q489359) (← links)
- On a covering problem in the hypercube (Q489361) (← links)
