The following pages link to Alexandr V. Kostochka (Q214987):
Displaying 50 items.
- Ralph Faudree (1938--2015) (Q279190) (← links)
- A list version of graph packing (Q284763) (← links)
- Toward Żak's conjecture on graph packing (Q286756) (← links)
- (Q312270) (redirect page) (← links)
- Coloring, sparseness and girth (Q312271) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- Turán problems and shadows. II: Trees (Q345098) (← links)
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Describing 3-paths in normal plane maps (Q394206) (← links)
- Describing faces in plane triangulations (Q394346) (← links)
- Ore's conjecture for \(k=4\) and Grötzsch's theorem (Q397076) (← links)
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs (Q404440) (← links)
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- A stability theorem on fractional covering of triangles by edges (Q412272) (← links)
- Harmonious coloring of trees with large maximum degree (Q418860) (← links)
- Richard Schelp (1936-2010) (Q432697) (← links)
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- Ohba's conjecture for graphs with independence number five (Q536225) (← links)
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- On graphs with small Ramsey numbers. II. (Q558242) (← links)
- Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
- Large minors in graphs with given independence number (Q641195) (← links)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← links)
- Covering boxes by points (Q687139) (← links)
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number (Q687719) (← links)
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs (Q698614) (← links)
- Dense graphs have \(K_{3,t}\) minors (Q709308) (← links)
- Hadwiger numbers and over-dominating colourings (Q709310) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Lower bound of the Hadwiger number of graphs by their average degree (Q760439) (← links)
- Berge cycles in non-uniform hypergraphs (Q783055) (← links)
- On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
- On sizes of 1-cross intersecting set pair systems (Q820485) (← links)
- On Ramsey numbers of uniform hypergraphs with given maximum degree (Q855851) (← links)
- Tree representations of graphs (Q875046) (← links)
- In memory of Dmitriĭ Germanovich Fon-Der-Flaass (Q890843) (← links)
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs (Q898127) (← links)
- Locally Hamiltonian graphs (Q912130) (← links)
- Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
- On \(K_{s,t}\)-minors in graphs with given average degree (Q941384) (← links)
- Minimax degrees of quasiplanar graphs with no short cycles other than triangles (Q947039) (← links)
- Minimum degree conditions for \(H\)-linked graphs (Q947099) (← links)
- Packing of graphs with small product of sizes (Q958696) (← links)
