The following pages link to Lars Døvling Andersen (Q882785):
Displayed 39 items.
- Largest non-unique subgraphs (Q882786) (← links)
- Removable edges in cyclically 4-edge-connected cubic graphs (Q1101466) (← links)
- (Q1137593) (redirect page) (← links)
- The cover-index of infinite graphs (Q1137594) (← links)
- Embedding incomplete Latin squares in Latin squares whose diagonal is almost completely prescribed (Q1143396) (← links)
- Generalized latin rectangles I: Construction and decomposition (Q1144022) (← links)
- Generalized latin rectangles. II: Embedding (Q1160182) (← links)
- Edge orbits and edge-deleted subgraphs (Q1187947) (← links)
- The strong chromatic index of a cubic graph is at most 10 (Q1201255) (← links)
- (Q1255965) (redirect page) (← links)
- Lower bounds on the cover-index of a graph (Q1255966) (← links)
- Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares (Q1356443) (← links)
- Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs (Q1392551) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- Graphs with all spanning trees nonisomorphic (Q1923474) (← links)
- Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus (Q1924123) (← links)
- On completing partial Latin squares with prescribed diagonals (Q2170804) (← links)
- Thank Evans! (Q3222202) (← links)
- (Q3320411) (← links)
- Small Embeddings of Incomplete Idempotent Latin Squares (Q3671997) (← links)
- (Q3676153) (← links)
- (Q3767352) (← links)
- Hamilton circuits with many colours in properly edge-coloured complete graphs. (Q3816096) (← links)
- (Q3853660) (← links)
- (Q3884118) (← links)
- Embedding Partial Steiner Triple Systems (Q3910533) (← links)
- Homopolar circuits in polar graphs (Q3926610) (← links)
- A Direct Construction for Latin Squares Without Proper Subsquares (Q3955357) (← links)
- Embedding Latin Squares with Prescribed Diagonal (Q3968939) (← links)
- On edge-colorings of graphs. (Q4149472) (← links)
- (Q4187835) (← links)
- (Q4294573) (← links)
- (Q4432216) (← links)
- Optimal acyclic edge‐coloring of cubic graphs (Q4650186) (← links)
- A Solution to the Embedding Problem for Partial Idempotent Latin Squares (Q4748160) (← links)
- Symmetric latin square and complete graph analogues of the evans conjecture (Q4764658) (← links)
- (Q4874584) (← links)
- (Q4877004) (← links)
- Latin squares (Q5416198) (← links)