The following pages link to Jan van den Heuvel (Q322313):
Displaying 50 items.
- Cyclic orderings and cyclic arboricity of matroids (Q414636) (← links)
- (Q489331) (redirect page) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- A linear bound on the diameter of the transportation polytope (Q858109) (← links)
- Mixing 3-colourings in bipartite graphs (Q1039431) (← links)
- (Q1309445) (redirect page) (← links)
- Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
- A generalization of Ore's Theorem involving neighborhood unions (Q1313847) (← links)
- Long cycles in graphs containing a 2-factor with many odd components (Q1343811) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Removable circuits in multigraphs (Q1386431) (← links)
- Radio channel assignment on 2-dimensional lattices (Q1400797) (← links)
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs (Q1569047) (← links)
- Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems (Q1599359) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Degree sums, \(k\)-factors and Hamilton cycles in graphs (Q1805370) (← links)
- Pancyclicity of hamiltonian line graphs (Q1842184) (← links)
- Long cycles in graphs with prescribed toughness and minimum degree (Q1894753) (← links)
- Hamilton cycles and eigenvalues of graphs (Q1899443) (← links)
- Toughness and triangle-free graphs (Q1907099) (← links)
- Extensions and consequences of Chvátal-Erdös' theorem (Q1923778) (← links)
- Degree sequences and the existence of \(k\)-factors (Q1926057) (← links)
- Uniform orderings for generalized coloring numbers (Q2225419) (← links)
- Long paths and cycles in tough graphs (Q2366213) (← links)
- A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
- Connectedness of the graph of vertex-colourings (Q2470462) (← links)
- (Q2760687) (← links)
- Algorithmic Aspects of a Chip-Firing Game (Q2777901) (← links)
- The complexity of change (Q2875857) (← links)
- Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
- Finding paths between 3-colorings (Q2998926) (← links)
- (Q3012389) (← links)
- (Q3104271) (← links)
- A new upper bound on the cyclic chromatic number (Q3418734) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- List Colouring Squares of Planar Graphs (Q3503513) (← links)
- Mixing 3-Colourings in Bipartite Graphs (Q3508565) (← links)
- On the Complexity of Ordered Colorings (Q3629479) (← links)
- Cycles containing all vertices of maximum degree (Q4201393) (← links)
- Graph labeling and radio channel assignment (Q4242956) (← links)
- Toughness, minimum degree, and the existence of 2‐factors (Q4309982) (← links)
- (Q4489197) (← links)
- Improper colourings inspired by Hadwiger's conjecture (Q4584332) (← links)
- Heavy cycles in weighted graphs (Q4786785) (← links)
- (Q4797462) (← links)
- Coloring the square of a planar graph (Q4797924) (← links)
- Relative length of long paths and cycles in graphs with large degree sums (Q4852406) (← links)
- On graphs satisfying a local ore-type condition (Q4862102) (← links)
- (Q4862113) (← links)
