The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- \(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\) (Q882791) (← links)
- Minor relations for quadrangulations on the sphere (Q897227) (← links)
- An intermediate value theorem for the decycling numbers of Toeplitz graphs (Q897228) (← links)
- \(\Pi\)-kernels in digraphs (Q897229) (← links)
- A balanced signed digraph (Q897230) (← links)
- Families of online sum-choice-greedy graphs (Q897232) (← links)
- Bounds and relations involving adjusted centrality of the vertices of a tree (Q897234) (← links)
- Cycle lengths of Hamiltonian \(P_\ell\)-free graphs (Q897235) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- Closure and Hamilton-connected claw-free hourglass-free graphs (Q897238) (← links)
- \(Z_3\)-connectivity of wreath product of graphs (Q897239) (← links)
- Hypohamiltonian oriented graphs of all possible orders (Q897240) (← links)
- Size and degree anti-Ramsey numbers (Q897241) (← links)
- Some results on the eigenvalues of distance-regular graphs (Q897242) (← links)
- On the full automorphism group of a Hamiltonian cycle system of odd order (Q897244) (← links)
- Difference systems of sets with size 2 (Q897246) (← links)
- Spanning trees whose stems are spiders (Q897247) (← links)
- \(N\)-flips in 4-connected even triangulations on the sphere (Q897249) (← links)
- Sum list colorings of wheels (Q897250) (← links)
- On affine-invariant two-fold quadruple systems (Q897251) (← links)
- 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions (Q897252) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs (Q897254) (← links)
- Linear programming bounds for regular graphs (Q897255) (← links)
- Rainbow numbers for graphs containing small cycles (Q897256) (← links)
- Complete \(r\)-partite graphs determined by their domination polynomial (Q897257) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- On super edge-antimagicness of circulant graphs (Q897264) (← links)
- The journey of the union-closed sets conjecture (Q897265) (← links)
- Graphical representations of graphic frame matroids (Q897266) (← links)
- Fan-type conditions for spanning Eulerian subgraphs (Q897267) (← links)
- Graphs with a 3-cycle-2-cover (Q897268) (← links)
- Characterizing forbidden pairs for Hamiltonian squares (Q897269) (← links)
- Vertex pancyclicity of quadrangularly connected claw-free graphs (Q897270) (← links)
- Augmentation of covering arrays of strength two (Q897271) (← links)
- Generalized pancyclic properties in claw-free graphs (Q897272) (← links)
- The total chromatic number of complete multipartite graphs with low deficiency (Q897273) (← links)
- On the number of resolving pairs in graphs (Q897274) (← links)
- Graph divisible designs and packing constructions (Q897275) (← links)
- Saturation numbers for linear forests \(P_5\cup tP_2\) (Q897277) (← links)
- Claw-free and \(N(2,1,0)\)-free graphs are almost net-free (Q897278) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- On the degree distance of unicyclic graphs with given matching number (Q897281) (← links)
- \([r,s,t]\)-colorings of friendship graphs and wheels (Q897282) (← links)
- On tight components and anti-tight components (Q897283) (← links)
- On three-color Ramsey number of paths (Q897286) (← links)
- On indicated coloring of graphs (Q897289) (← links)
- On the balanced decomposition number (Q897290) (← links)
- The relaxed game chromatic number of graphs with cut-vertices (Q897291) (← links)
- Some results on exclusive sum labelings of hypergraphs (Q897292) (← links)
