The following pages link to (Q4830805):
Displaying 50 items.
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- Note on vertex and total proper connection numbers (Q334117) (← links)
- Combinatorial theorems in sparse random sets (Q350550) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- On the size and structure of graphs with a constant number of 1-factors (Q418889) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Extremal results for odd cycles in sparse pseudorandom graphs (Q484999) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- Augmented \(k\)-ary \(n\)-cubes (Q621635) (← links)
- New results on EX graphs (Q626971) (← links)
- Topological minors in bipartite graphs (Q644636) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- On the chromatic number of \(H\)-free graphs of large minimum degree (Q659735) (← links)
- Turán numbers for disjoint copies of graphs (Q659740) (← links)
- Cooperative cross-entropy method for generating entangled networks (Q666364) (← links)
- Extremal norms of graphs and matrices (Q690533) (← links)
- Small cycles and 2-factor passing through any given vertices in graphs (Q711538) (← links)
- Paths and cycles concerning independence edges (Q757417) (← links)
- Packing two graphs of order n having total size at most 2n-2 (Q803166) (← links)
- On the upper bounds of the numbers of perfect matchings in graphs with given parameters (Q871682) (← links)
- Contractions and minimal k-colorability (Q916670) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- Unavoidable patterns (Q958758) (← links)
- One-to-many node-disjoint paths in \((n,k)\)-star graphs (Q968113) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- A lower bound for the spectral radius of graphs with fixed diameter (Q992783) (← links)
- Graphic sequences with a realization containing a union of cliques (Q995771) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\) (Q1044999) (← links)
- The maximum number of disjoint pairs in a family of subsets (Q1066898) (← links)
- Decomposition of graphs and monotone formula size of homogeneous functions (Q1071036) (← links)
- Hyperconnectivity of graphs (Q1086586) (← links)
- Critical star multigraphs (Q1089350) (← links)
- Large induced degenerate subgraphs (Q1092059) (← links)
- Repeated distances in space (Q1109785) (← links)
- Special subdivisions of \(K_4\) and 4-chromatic graphs (Q1132888) (← links)
- Non-separating induced cycles in graphs (Q1150377) (← links)
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs (Q1175549) (← links)
- Rotation numbers for complete tripartite graphs (Q1175562) (← links)
- Edges in graphs with large girth (Q1180673) (← links)
- Packing of partial designs (Q1323485) (← links)
- Partial order complementation graphs (Q1344245) (← links)
- Better bounds for perpetual gossiping (Q1363648) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Retracted: A remark on the weak Turán's theorem (Q1650389) (← links)
- Contagious sets in dense graphs (Q1678088) (← links)
- Extremal graph theory and finite forcibility (Q1689971) (← links)
