The following pages link to (Q5315023):
Displayed 50 items.
- Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (Q2851443) (← links)
- Parameterized complexity of the maximum independent set problem and the speed of hereditary properties (Q2851451) (← links)
- (Q2857321) (← links)
- (Q2857429) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Planar Disjoint-Paths Completion (Q2891339) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them (Q2917207) (← links)
- Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
- On the connectivity of manifold graphs (Q2944764) (← links)
- A $$\varGamma $$-magic Rectangle Set and Group Distance Magic Labeling (Q2946047) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
- Dichotomy for Coloring of Dart Graphs (Q3000496) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- Vertex decomposable graphs and obstructions to shellability (Q3182562) (← links)
- Querying Regular Graph Patterns (Q3189642) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Monotone Crossing Number (Q3223961) (← links)
- Explaining Hierarchical Multi-linear Models (Q3297809) (← links)
- On irreversible spread of influence in edge-weighted graphs (Q3303530) (← links)
- (Q3304097) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Exponentially many hypohamiltonian snarks (Q3439614) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- A New Characterization of P 6-Free Graphs (Q3511353) (← links)
- Discovery of Network Properties with All-Shortest-Paths Queries (Q3511392) (← links)
- Self-stabilizing Cuts in Synchronous Networks (Q3511402) (← links)
- Fast Distributed Approximations in Planar Graphs (Q3540222) (← links)
- On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants (Q3576067) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Decompositional Petri Net Reductions (Q3605479) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces (Q3611866) (← links)
- Polyhedral embeddings of snarks in orientable surfaces (Q3625534) (← links)