The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\) (Q1015439) (← links)
- On a zero-sum generalization of a variation of Schur's equation (Q1015440) (← links)
- Factor-critical graphs with given number of maximum matchings (Q1015441) (← links)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786) (← links)
- The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (Q1043788) (← links)
- Further 6-sparse Steiner triple systems (Q1043789) (← links)
- Frankl's conjecture and the dual covering property (Q1043790) (← links)
- A comment on Ryser's conjecture for intersecting hypergraphs (Q1043791) (← links)
- Perpendicular rectangular Latin arrays (Q1043793) (← links)
- Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) (Q1043794) (← links)
- A new bound on the total domination subdivision number (Q1043795) (← links)
- On the existence of elementary Abelian cycle systems (Q1043796) (← links)
- List point arboricity of dense graphs (Q1043798) (← links)
- Transitive, locally finite median graphs with finite blocks (Q1043799) (← links)
- Bounding the size of equimatchable graphs of fixed genus (Q1043800) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- On the chromaticity of multi-bridge hypergraphs (Q1043804) (← links)
- An asymptotic independence theorem for the number of matchings in graphs (Q1043805) (← links)
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs (Q1043806) (← links)
- Sparsity-certifying graph decompositions (Q1043807) (← links)
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity (Q1043808) (← links)
- On characterizations of rigid graphs in the plane using spanning trees (Q1043809) (← links)
- Upper embeddability, girth and the degree-sum of nonadjacent vertices (Q1043810) (← links)
- Total domination in partitioned graphs (Q1043811) (← links)
- The signless Laplacian spectral radius of graphs with given number of pendant vertices (Q1043812) (← links)
- Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs (Q1043813) (← links)
- Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic (Q1043814) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- Small cycle double covers of products. II: Categorical and strong products with paths and cycles (Q1043816) (← links)
- On b-perfect chordal graphs (Q1043818) (← links)
- Longest cycles in 3-connected graphs with given independence number (Q1043819) (← links)
- On geometric graph Ramsey numbers (Q1043821) (← links)
- On polygons enclosing point sets. II (Q1043822) (← links)
- Invariants of composite networks arising as a tensor product (Q1043823) (← links)
- The basis digraphs of \(p\)-schemes (Q1043824) (← links)
- Total restrained domination in cubic graphs (Q1043826) (← links)
- A Hadamard matrix of order 268 (Q1061128) (← links)
- Counting labelled chordal graphs (Q1062069) (← links)
- The lexicographic sum of Cohen-Macaulay and shellable ordered sets (Q1062080) (← links)
- Smallest regular graphs with girth pair \((4,2t+1)\) (Q1063001) (← links)
- Cyclic automorphisms of a countable graph and random sum-free sets (Q1063005) (← links)
- On factors with all degrees odd (Q1063044) (← links)
- On a construction of critical graphs which are not sensitive (Q1064327) (← links)
- Lower bounds for Turán's problem (Q1065822) (← links)
- Randomly n-cyclic digraphs (Q1065824) (← links)
- A maximal cover of hexagonal systems (Q1065827) (← links)
- Subgraphs with large degrees and girth (Q1066158) (← links)
- The maximum number of disjoint pairs in a family of subsets (Q1066898) (← links)
- A new approach to Turán's conjecture (Q1066899) (← links)
