The following pages link to Discrete Mathematics (Q175483):
Displaying 50 items.
- On the activities of \(p\)-basis of matroid perspectives (Q267171) (← links)
- Circumferences of 3-connected claw-free graphs (Q267172) (← links)
- Bounded quantifier depth spectra for random graphs (Q267173) (← links)
- Total dominating sequences in graphs (Q267175) (← links)
- Cop vs. gambler (Q267177) (← links)
- The \(H\)-spectra of a class of generalized power hypergraphs (Q267180) (← links)
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- An extremal problem for vertex partition of complete multipartite graphs (Q267182) (← links)
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals (Q267186) (← links)
- Minimum size blocking sets of certain line sets related to a conic in \(\mathrm{PG}(2, q)\) (Q267189) (← links)
- Correction to ``A study of covering dimension for the class of finite lattices'' (Q267193) (← links)
- Equitable vertex arboricity of subcubic graphs (Q267194) (← links)
- The maximum number of subset divisors of a given size (Q267196) (← links)
- The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
- The clique number and the smallest \(Q\)-eigenvalue of graphs (Q267202) (← links)
- The vertex size-Ramsey number (Q267205) (← links)
- Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs (Q267208) (← links)
- On the completability of incomplete orthogonal Latin rectangles (Q267209) (← links)
- Ramsey degrees, labeled and unlabeled partitions (Q267211) (← links)
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Bicircular matroids are 3-colorable (Q271597) (← links)
- Non-recursive freeness and non-rigidity (Q271598) (← links)
- Pairwise balanced designs and sigma clique partitions (Q271601) (← links)
- On formal inverse of the Prouhet-Thue-Morse sequence (Q271604) (← links)
- On the total coloring of generalized Petersen graphs (Q271609) (← links)
- On the embedding of partial three path designs (Q271611) (← links)
- On a general class of non-squashing partitions (Q271616) (← links)
- Weight of edges in normal plane maps (Q271617) (← links)
- Enumeration of antisymmetric monotone triangles and domino tilings of quartered Aztec rectangles (Q271618) (← links)
- Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\) (Q271620) (← links)
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Bounds on the maximum number of minimum dominating sets (Q271624) (← links)
- Another exploration problem (Q271626) (← links)
- Clique number of the square of a line graph (Q271628) (← links)
- Stability and Ramsey numbers for cycles and wheels (Q271630) (← links)
- Tetravalent half-arc-transitive graphs of order a product of three primes (Q271635) (← links)
- Characterization of graphs with given order, given size and given matching number that minimize nullity (Q271637) (← links)
- Spanning trees with bounded degrees and leaves (Q271638) (← links)
- Total-colorings of complete multipartite graphs using amalgamations (Q271641) (← links)
- Counting dominating sets and related structures in graphs (Q271644) (← links)
- Element deletion changes in dynamic coloring of graphs (Q271647) (← links)
- On the diameter of cut polytopes (Q271649) (← links)
- Exterior splashes and linear sets of rank 3 (Q271651) (← links)
- Long module skew codes are good (Q271652) (← links)
- Ralph Faudree (1938--2015) (Q279190) (← links)
- Strategic balance in graphs (Q279193) (← links)
- Interval cyclic edge-colorings of graphs (Q279196) (← links)
- Global defensive sets in graphs (Q279197) (← links)
- Counting ordered graphs that avoid certain subgraphs (Q279199) (← links)
- Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
