The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- 4-cycle systems of \(K_n-E(F^\ast)\) (Q497370) (← links)
- Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length (Q497372) (← links)
- Restricted connectivity for some interconnection networks (Q497373) (← links)
- The Chvátal-Erdős condition for a graph to have a spanning trail (Q497374) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- On graphs with a unique perfect matching (Q497377) (← links)
- A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
- An improved upper bound on edge weight choosability of graphs (Q497381) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← links)
- Rainbow connection in some digraphs (Q503612) (← links)
- The best mixing time for random walks on trees (Q503614) (← links)
- New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs (Q503616) (← links)
- Snarks, hypohamiltonian graphs and non-supereulerian graphs (Q503617) (← links)
- Monochromatic solutions for multi-term unknowns (Q503618) (← links)
- Chorded cycles (Q503621) (← links)
- Generalizations of marriage theorem for degree factors (Q503622) (← links)
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set (Q503623) (← links)
- Some triangulated surfaces without balanced splitting (Q503625) (← links)
- Arc-transitive pentavalent graphs of square-free order (Q503627) (← links)
- Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs (Q503630) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- Orientations making \(k\)-cycles cyclic (Q503634) (← links)
- Induced cycles in graphs (Q503635) (← links)
- Discrepancy one among homogeneous arithmetic progressions (Q503637) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- Cubic bridgeless graphs and braces (Q503640) (← links)
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641) (← links)
- Total colorings of graphs with minimum sum of colors (Q503645) (← links)
- Computing planarity in computable planar graphs (Q503647) (← links)
- On the Ramsey-goodness of paths (Q503648) (← links)
- Clique-perfectness of claw-free planar graphs (Q503649) (← links)
- Doubly resolvable H designs (Q503650) (← links)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity (Q503651) (← links)
- Hamiltonian laceability of hypercubes without isometric subgraphs (Q503653) (← links)
- Notes on use of generalized entropies in counting (Q503654) (← links)
- On distance-regular graphs with fixed valency (Q580374) (← links)
- Cycles through five edges in 3-connected cubic graphs (Q581414) (← links)
- Sub-Ramsey numbers of arithmetic progressions (Q582303) (← links)
- A note on binary fundamental transversal matroids (Q583217) (← links)
- Paths and cycles in matroid base graphs (Q583218) (← links)
- On the factor-thickness of regular graphs (Q583237) (← links)
- A perfect one-factorization of \(K_{36}\) (Q584283) (← links)
- The 3-connected graphs with exactly \(k\) non-essential edges (Q604648) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- Paired-domination in subdivided star-free graphs (Q604650) (← links)
- Bounds on the total restrained domination number of a graph (Q604651) (← links)
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations (Q604652) (← links)
