The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- A new zero-divisor graph contradicting Beck's conjecture, and the classification for a family of polynomial quotients (Q897293) (← links)
- An analogy between edge colourings and differentiable manifolds, with a new perspective on 3-critical graphs (Q897294) (← links)
- Ramsey numbers of \(C_4\) versus wheels and stars (Q897296) (← links)
- All complete graph-wheel planar Ramsey numbers (Q897297) (← links)
- Three results on cycle-wheel Ramsey numbers (Q897298) (← links)
- Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs (Q897300) (← links)
- New Hadamard matrix of order 24 (Q908927) (← links)
- Totient-numbers of the rectangular association scheme (Q910409) (← links)
- Colouring prime distance graphs (Q912118) (← links)
- Schur rings and cyclic association schemes of class three (Q912204) (← links)
- On the number of alignments of k sequences (Q912848) (← links)
- On distance-regular graphs with fixed valency. II (Q912864) (← links)
- On well-quasi-ordering finite structures with labels (Q912875) (← links)
- Implicit-degrees and circumferences (Q913815) (← links)
- Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture (Q914704) (← links)
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries (Q915122) (← links)
- Contractions and minimal k-colorability (Q916670) (← links)
- Distance degrees of vertex-transitive graphs (Q917573) (← links)
- On Ramsey families of sets (Q917575) (← links)
- Events correlated with respect to every subposet of a fixed poset (Q919000) (← links)
- Every 4k-edge-connected graph is weakly 3k-linked (Q920108) (← links)
- P\({}_ 3\)-factorization of complete multipartite graphs (Q920114) (← links)
- On perfect one-factorization of the complete graph \(K_{2p}\) (Q920115) (← links)
- On the independent queens covering problem (Q921006) (← links)
- Sperner families satisfying additional conditions and their convex hulls (Q921020) (← links)
- Addendum to ``Bicolored matchings in some classes of graphs'' (Q937244) (← links)
- Relations between the circumference and \(e\)-circumference of a matroid (Q937245) (← links)
- A note on the structure of Turán densities of hypergraphs (Q937246) (← links)
- A note on the game chromatic index of graphs (Q937247) (← links)
- Path-factors in the square of a tree (Q937248) (← links)
- A 2-factor with short cycles passing through specified independent vertices in graph (Q937249) (← links)
- Equitable partitions of flat association schemes (Q937250) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- On jumping densities of hypergraphs (Q968206) (← links)
- Minimum difference representations of graphs (Q968207) (← links)
- An upper bound for the total domination subdivision number of a graph (Q968208) (← links)
- Elementary graphs with respect to \(f\)-parity factors (Q968209) (← links)
- Maximum packings and minimum coverings of \(K_{v}\) with octagons (Q968211) (← links)
- Restrained domination in claw-free graphs with minimum degree at least two (Q968212) (← links)
- A characterization of cubic graphs with paired-domination number three-fifths their order (Q968213) (← links)
- A note on totally free matroids (Q968214) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- Diameter-preserving spanning trees in sparse weighted graphs (Q968216) (← links)
- Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures (Q968218) (← links)
- Determining sets, resolving sets, and the exchange property (Q968219) (← links)
- Packing and covering triangles in planar graphs (Q968221) (← links)
- On defining sets of full designs with block size three (Q968222) (← links)
- Set-coloring of edges and multigraph Ramsey numbers (Q968224) (← links)
- Matching properties in total domination vertex critical graphs (Q968225) (← links)
- Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
