The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected (Q659731) (← links)
- Factorizations of complete graphs into trees with at most four non-leave vertices (Q659732) (← links)
- Perfect matchings in total domination critical graphs (Q659733) (← links)
- Construction of Hamilton path tournament designs (Q659734) (← links)
- On the chromatic number of \(H\)-free graphs of large minimum degree (Q659735) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- Weakly cycle complementary 3-partite tournaments (Q659739) (← links)
- Turán numbers for disjoint copies of graphs (Q659740) (← links)
- Sums of powers of the degrees of graphs with \(k\) cut edges (Q659742) (← links)
- On the perfect matchings of near regular graphs (Q659743) (← links)
- Domination number of graphs without small cycles (Q659744) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Maximum hitting of a set by compressed intersecting families (Q659747) (← links)
- Symmetrized induced Ramsey theory (Q659748) (← links)
- Linear and 2-frugal choosability of graphs of small maximum average degree (Q659749) (← links)
- Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\) (Q659751) (← links)
- Splitting off operation for binary matroids and its applications (Q659753) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Outerplanar thrackles (Q659755) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Counting orientable embeddings by genus for a type of 3-regular graph (Q659758) (← links)
- Connected domination number of a graph and its complement (Q659759) (← links)
- Dominator colorings in some classes of graphs (Q659760) (← links)
- Convex sets in lexicographic products of graphs (Q659762) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- \(d\)-cube decompositions of \(K_n\setminus K_m\) (Q675883) (← links)
- Searching for counterfeit coins (Q675884) (← links)
- The girth of a thin distance-regular graph (Q675886) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Cycle-pancyclism in tournaments. III (Q675888) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- Partitions of bipartite numbers (Q675892) (← links)
- A new recursive theorem on \(n\)-extendibility (Q675894) (← links)
- The problem of irregular perfect systems of sets of iterated differences (Q675897) (← links)
- On a criterion for matchability in hypergraphs (Q687713) (← links)
- Askey-Wilson polynomials, kernel polynomials and association schemes (Q687716) (← links)
- Triples and hexagons (Q687718) (← links)
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number (Q687719) (← links)
- Planar graphs and greatest common subgraphs (Q687720) (← links)
- A translation plane of order \(7^ 2\) with a very small translation complement (Q687724) (← links)
- On the BKT inequality and improved bounds for perfect systems of difference sets (Q687725) (← links)
- Five discordant permutations (Q687727) (← links)
- Combinatorial congruences from \(p\)-subgroups of the symmetric group (Q687729) (← links)
- Hamiltonian connected claw-free graphs (Q704830) (← links)
- The chromaticity of certain complete multipartite graphs (Q704831) (← links)
- On pattern Ramsey numbers of graphs (Q704832) (← links)
- On resolvable multipartite \(G\)-designs (Q704833) (← links)
- Removable edges in longest cycles of 4-connected graphs (Q704835) (← links)
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs (Q704836) (← links)
