The following pages link to Discrete Mathematics (Q175483):
Displaying 50 items.
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs (Q383688) (← links)
- Harmonic labeling of graphs (Q383691) (← links)
- 25 new \(r\)-self-orthogonal Latin squares (Q383692) (← links)
- Non-trivial intersecting uniform sub-families of hereditary families (Q383693) (← links)
- Forbidden subgraphs generating a finite set (Q383734) (← links)
- On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs (Q383736) (← links)
- Achromatic number of collections of paths and cycles (Q383738) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Triple metamorphosis of twofold triple systems (Q383743) (← links)
- The rainbow connection number of 2-connected graphs (Q383747) (← links)
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs (Q383748) (← links)
- Guides and shortcuts in graphs (Q383749) (← links)
- Highly non-concurrent longest cycles in lattice graphs (Q383750) (← links)
- A note on powers of Hamilton cycles in generalized claw-free graphs (Q383751) (← links)
- Balanced degree-magic complements of bipartite graphs (Q383753) (← links)
- The minimum size of \(k\)-rainbow connected graphs of given order (Q383755) (← links)
- A short proof of the versatile version of Fleischner's theorem (Q383756) (← links)
- Circumferences of 2-factors in claw-free graphs (Q383757) (← links)
- The empire problem in even embeddings on closed surfaces with \(\varepsilon\leq 0\) (Q383759) (← links)
- Cubic factorizations (Q383761) (← links)
- The property of \(k\)-colourable graphs is uniquely decomposable (Q383763) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- On doubly light triangles in plane graphs (Q383767) (← links)
- Cycles in squares of trees without generalized claws (Q383769) (← links)
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound (Q383771) (← links)
- Problems on cycles and colorings (Q383772) (← links)
- Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes (Q383775) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Color the cycles (Q383778) (← links)
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Upper bounds for the bondage number of graphs on topological surfaces (Q385372) (← links)
- Archimedean graph designs (Q385374) (← links)
- The set of autotopisms of partial Latin squares (Q385375) (← links)
- On graphs with an eigenvalue of maximal multiplicity (Q385377) (← links)
- Generalized packing designs (Q385379) (← links)
- The existence of strong complete mappings of finite groups: a survey (Q385380) (← links)
- Tree-designs with balanced-type conditions (Q385383) (← links)
- On automorphisms of the countable p.e.c. graph (Q385386) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- A note on sparseness conditions on chordless vertices of cycles (Q385389) (← links)
- A class of graphs with depression three (Q385391) (← links)
- Dixon's theorem and random synchronization (Q385392) (← links)
- Hyperplanes of \(DW(5,\mathbb K)\) containing a quad (Q385393) (← links)
- The complexity of the empire colouring problem for linear forests (Q385396) (← links)
- The asymptotic number of spanning forests of complete bipartite labelled graphs (Q385398) (← links)
- Counting 2-connected deletion-minors of binary matroids (Q385399) (← links)
- Forbidden induced subgraphs for near perfect matchings (Q385401) (← links)
- A note on connected cubic Cayley graphs (Q385724) (← links)
- Small distances in convex polygons (Q385726) (← links)
- A 4-dimensional graph has at least 9 edges (Q385728) (← links)
