Pages that link to "Item:Q4720697"
From MaRDI portal
The following pages link to The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices (Q4720697):
Displayed 35 items.
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- Matrix-free preconditioning using partial matrix estimation (Q855287) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
- A chordal preconditioner for large-scale optimization (Q1262220) (← links)
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation (Q1694294) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← links)
- Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
- Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
- Acyclic edge coloring of planar graphs without cycles of specific lengths (Q2251751) (← links)
- On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
- Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope (Q2840711) (← links)
- Optimal direct determination of sparse Jacobian matrices (Q2867431) (← links)
- Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
- A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
- Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation (Q5746686) (← links)
- (Q5874489) (← links)
- A polyhedral study of the acyclic coloring problem (Q5891089) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Acyclic 3-coloring of generalized Petersen graphs (Q5963660) (← links)
- Star chromatic number of some graph products (Q6059104) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)