The following pages link to Matthew Johnson (Q309789):
Displayed 50 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- What graphs are 2-dot product graphs? (Q322356) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
- Amalgamations of factorizations of complete graphs (Q885295) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
- Mixing 3-colourings in bipartite graphs (Q1039431) (← links)
- Amalgamations of connected \(k\)-factorizations. (Q1400963) (← links)
- Obtaining online ecological colourings by generalizing first-fit (Q1678751) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Defining sets for Latin squares given that they are based on groups (Q1869037) (← links)
- Amalgamations of factorizations of complete equipartite graphs (Q1876684) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- Steiner trees for hereditary graph classes (Q2081657) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy (Q2285091) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- Connectedness of the graph of vertex-colourings (Q2470462) (← links)
- The computational complexity of the parallel knock-out problem (Q2481963) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- (Q2712530) (← links)
- Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs (Q2798222) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- (Q2857338) (← links)
- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs (Q2872078) (← links)
- A Reconfigurations Analogue of Brooks’ Theorem (Q2922616) (← links)
- Knocking Out P k -free Graphs (Q2922626) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Finding paths between 3-colorings (Q2998926) (← links)
- (Q3104255) (← links)
- (Q3104271) (← links)
- SOME RESULTS ON THE OBERWOLFACH PROBLEM (Q3151065) (← links)
- Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- Mixing 3-Colourings in Bipartite Graphs (Q3508565) (← links)
- The Computational Complexity of the Parallel Knock-Out Problem (Q3525764) (← links)
- Obtaining Online Ecological Colourings by Generalizing First-Fit (Q3569747) (← links)
- An algorithm for finding factorizations of complete graphs (Q4406068) (← links)
- Characterization of graphs with hall number 2 (Q4458593) (← links)
- Weak Uniquely Completable Sets for Finite Groups (Q4487653) (← links)
- Enclosings of decompositions of complete multigraphs in 2‐factorizations (Q4685298) (← links)
- (Q5005166) (← links)