The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- A problem of Shapozenko on Johnson graphs (Q283683) (← links)
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- Spectrum of mixed bi-uniform hypergraphs (Q292241) (← links)
- Uniquely tree-saturated graphs (Q292245) (← links)
- EKR sets for large \(n\) and \(r\) (Q292246) (← links)
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- A cyclic solution for an infinite class of Hamilton-Waterloo problems (Q292248) (← links)
- Coloring complete and complete bipartite graphs from random lists (Q292251) (← links)
- Critical sets of full \(n\)-Latin squares (Q292254) (← links)
- A twelve vertex theorem for 3-connected claw-free graphs (Q292255) (← links)
- Network decontamination with a single agent (Q292259) (← links)
- Excluded-minor characterization of apex-outerplanar graphs (Q292261) (← links)
- Richardson's theorem in \(H\)-coloured digraphs (Q292262) (← links)
- Asymptotic normality of some graph sequences (Q292264) (← links)
- Anti-Ramsey numbers of graphs with small connected components (Q292266) (← links)
- On models of directed path graphs non rooted directed path graphs (Q292267) (← links)
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (Q292269) (← links)
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs (Q292270) (← links)
- Free choosability of outerplanar graphs (Q293600) (← links)
- Forcing posets with large dimension to contain large standard examples (Q293603) (← links)
- Note on semi-linkage with almost prescribed lengths in large graphs (Q293607) (← links)
- Generalisations of hypomorphisms and reconstruction of hypergraphs (Q293609) (← links)
- Orthogonal trades and the intersection problem for orthogonal arrays (Q293614) (← links)
- On isomorphisms of Marušič-Scapellato graphs (Q293616) (← links)
- Counting carambolas (Q293619) (← links)
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges (Q293622) (← links)
- Locating pairs of vertices on a Hamiltonian cycle in bigraphs (Q293624) (← links)
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628) (← links)
- On the maximum weight of a sparse connected graph of given order and size (Q293629) (← links)
- Universal and overlap cycles for posets, words, and juggling patterns (Q293633) (← links)
- Distance magic labeling in complete 4-partite graphs (Q293634) (← links)
- Generating function of the tilings of an Aztec rectangle with holes (Q293635) (← links)
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations (Q293640) (← links)
- A completion of the spectrum for the overlarge sets of pure Mendelsohn triple systems (Q293641) (← links)
- An oriented 6-coloring of planar graphs with girth at least 9 (Q293643) (← links)
- A construction of smooth travel groupoids on finite graphs (Q293646) (← links)
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions (Q293647) (← links)
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Edge-removal and edge-addition in \(\alpha \)-domination (Q293651) (← links)
- Percolation with small clusters on random graphs (Q293653) (← links)
- On computing the number of Latin rectangles (Q293658) (← links)
- Total weight choosability of cone graphs (Q293660) (← links)
- Signed Roman \(k\)-domination in digraphs (Q293661) (← links)
- Optimal pebbling on grids (Q293664) (← links)
- Finite 2-geodesic transitive abelian Cayley graphs (Q295252) (← links)
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- On star-wheel Ramsey numbers (Q295255) (← links)
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- Chromatic polynomials of simplicial complexes (Q295259) (← links)
