The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- Building graphs whose independence polynomials have only real roots (Q844224) (← links)
- On substructure densities of hypergraphs (Q844225) (← links)
- Induced-universal graphs for graphs with bounded maximum degree (Q844226) (← links)
- A description of the resonance variety of a line combinatorics via combinatorial pencils (Q844228) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Domino tiling congruence modulo 4 (Q844231) (← links)
- Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs (Q844233) (← links)
- The four-in-a-tree problem in triangle-free graphs (Q844235) (← links)
- Fast winning strategies in avoider-enforcer games (Q844236) (← links)
- A five color zero-sum generalization (Q855293) (← links)
- Coloring vertices and faces of locally planar graphs (Q855294) (← links)
- Minimal connected \(\tau\)-critical hypergraphs (Q855295) (← links)
- On Hamilton cycle decomposition of 6-regular circulant graphs (Q855297) (← links)
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) (Q855298) (← links)
- On a \(k\)-tree containing specified leaves in a graph (Q855299) (← links)
- Sub-Ramsey numbers for arithmetic progressions (Q855300) (← links)
- On the intersection problem for Steiner triple systems of different orders (Q855301) (← links)
- Contractible cliques in \(k\)-connected graphs (Q855302) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- Induced matching extendable graph powers (Q855304) (← links)
- Reconstructing under group actions. (Q855305) (← links)
- Circuits and cocircuits in regular matroids (Q855306) (← links)
- Graph theory and discrete geometry. Papers from the conference in honor of Frank Harary's 80th birthday, Manila, Thailand, October 15--17, 2001 (Q871744) (← links)
- Three-class association schemes on Galois rings in characteristic 4 (Q878051) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) (Q878054) (← links)
- 3-colorable even embeddings on closed surfaces (Q878057) (← links)
- Realizable quadruples for hex-polygons. Combinatorics of honeycombs (Q878059) (← links)
- Non-jumping numbers for 4-uniform hypergraphs (Q878060) (← links)
- Subdivision extendibility (Q879940) (← links)
- Coverings of the vertices of a graph by small cycles (Q879941) (← links)
- Rainbows in the hypercube (Q879943) (← links)
- Enumeration of unlabelled mating graphs (Q879945) (← links)
- Orthogonal double covers of complete graphs by caterpillars of diameter 5 (Q879946) (← links)
- Simple proofs of results on paths representing all colors in proper vertex-colorings (Q879947) (← links)
- Consistent cycles in graphs and digraphs (Q879948) (← links)
- Colouring cubic graphs by small Steiner triple systems (Q879950) (← links)
- A degree constraint for uniquely Hamiltonian graphs (Q882780) (← links)
- Almost symmetric cycles in large digraphs (Q882781) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- There exist highly critically connected graphs of diameter three (Q882783) (← links)
- A characterization of graphs without even factors (Q882784) (← links)
- Largest non-unique subgraphs (Q882786) (← links)
- Sizes of critical graphs with small maximum degrees (Q882787) (← links)
- On the circuit-cocircuit intersection conjecture (Q882788) (← links)
- Kite-group divisible designs of type \(g^{ t } u^{1}\) (Q882789) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
