The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs (Q704838) (← links)
- Some \(L\)-function of a regular covering of a graph (Q704839) (← links)
- Random hypergraph processes with degree restrictions (Q704841) (← links)
- The number of negative entries in a sign pattern allowing orthogonality (Q704842) (← links)
- Generalizing pancyclic and \(k\)-ordered graphs (Q704843) (← links)
- Sum list coloring block graphs (Q704844) (← links)
- Minimum degree conditions for cycles including specified sets of vertices (Q704845) (← links)
- Cycle switches in Latin squares (Q704846) (← links)
- A solution to a problem of Jacobson, Kézdy and Lehel (Q704848) (← links)
- Hamilton decomposable graphs with specified leaves (Q704849) (← links)
- Colorability of planar graphs with isolated nontriangular faces (Q704852) (← links)
- Paired-domination in claw-free cubic graphs (Q704853) (← links)
- On the set of cycle lengths in a Hamiltonian graph with a given maximum degree (Q704854) (← links)
- Edge decompositions of multigraphs into 3-matchings (Q704855) (← links)
- Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs (Q704856) (← links)
- On cyclic packing of a tree (Q704857) (← links)
- A note on regular near polygons (Q704859) (← links)
- Even \(2 \times 2\) submatrices of a random zero-one matrix (Q704860) (← links)
- Representing graphs in Steiner triple systems (Q742566) (← links)
- Maximum hitting for \(n\) sufficiently large (Q742567) (← links)
- Rainbow connection number and radius (Q742568) (← links)
- Chromatic polynomials of complements of bipartite graphs (Q742569) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- The Steiner problem on surfaces of revolution (Q742573) (← links)
- Special eccentric vertices for the class of chordal graphs and related classes (Q742574) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- List-coloring claw-free graphs with small clique number (Q742576) (← links)
- A larger family of planar graphs that satisfy the total coloring conjecture (Q742577) (← links)
- A note on large rainbow matchings in edge-coloured graphs (Q742578) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- The existence of \(\mathrm{FrGBTD}(4,g^u)\)s (Q742582) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly (Q742585) (← links)
- Seidel integral complete \(r\)-partite graphs (Q742588) (← links)
- Strong 5-cycle double covers of graphs (Q742589) (← links)
- Collapsible graphs and Hamiltonicity of line graphs (Q742590) (← links)
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs (Q742591) (← links)
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs (Q742594) (← links)
- Witness rectangle graphs (Q742595) (← links)
- A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- The smallest one-realization of a given set. III (Q742599) (← links)
- Note on locating pairs of vertices on Hamiltonian cycles (Q742600) (← links)
- Constructions of large graphs on surfaces (Q742602) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Closure and spanning \(k\)-trees (Q742606) (← links)
- Upper bounds for the automorphic chromatic index of a graph (Q742607) (← links)
