Pages that link to "Item:Q2827797"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q2827797):
Displaying 50 items.
- The Normal Graph Conjecture for Classes of Sparse Graphs (Q2864291) (← links)
- On the Parameterized Complexity of Computing Graph Bisections (Q2864292) (← links)
- Fixed-Parameter Tractability and Characterizations of Small Special Treewidth (Q2864293) (← links)
- The θ 5-Graph is a Spanner (Q2864294) (← links)
- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Q2864295) (← links)
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296) (← links)
- Equilateral L-Contact Graphs (Q2864297) (← links)
- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees (Q2864298) (← links)
- Linear Separation of Total Dominating Sets in Graphs (Q2864299) (← links)
- Sparse Square Roots (Q2864300) (← links)
- Completing Colored Graphs to Meet a Target Property (Q2864301) (← links)
- Colouring of Graphs with Ramsey-Type Forbidden Subgraphs (Q2864302) (← links)
- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs (Q2864303) (← links)
- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time (Q2864304) (← links)
- Thickness and Colorability of Geometric Graphs (Q2864305) (← links)
- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube (Q2864306) (← links)
- FPT Is Characterized by Useful Obstruction Sets (Q2864307) (← links)
- Excluding Graphs as Immersions in Surface Embedded Graphs (Q2864308) (← links)
- OBDD-Based Representation of Interval Graphs (Q2864309) (← links)
- Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs (Q2864310) (← links)
- A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem (Q2864311) (← links)
- On Retracts, Absolute Retracts, and Folds in Cographs (Q2864312) (← links)
- Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors (Q2864313) (← links)
- On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs (Q2864314) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs (Q2864317) (← links)
- Beyond Knights and Knaves (Q2864319) (← links)
- Connecting Terminals and 2-Disjoint Connected Subgraphs (Q2864321) (← links)
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) (Q2945175) (← links)
- Distributedly Testing Cycle-Freeness (Q2945176) (← links)
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs (Q2945178) (← links)
- Linear Rank-Width of Distance-Hereditary Graphs (Q2945179) (← links)
- Vertex Contact Graphs of Paths on a Grid (Q2945180) (← links)
- Boxicity and Separation Dimension (Q2945181) (← links)
- Independent Set Reconfiguration in Cographs (Q2945182) (← links)
- A New Characterization of $$P_k$$-free Graphs (Q2945184) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- The Maximum Labeled Path Problem (Q2945186) (← links)
- Minimum Spanning Tree Verification Under Uncertainty (Q2945187) (← links)
- Towards the Hanani-Tutte Theorem for Clustered Graphs (Q2945188) (← links)
- On Set Expansion Problems and the Small Set Expansion Conjecture (Q2945189) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
- Induced Disjoint Paths in Circular-Arc Graphs in Linear Time (Q2945192) (← links)
- Parameterized Directed $$k$$-Chinese Postman Problem and $$k$$ Arc-Disjoint Cycles Problem on Euler Digraphs (Q2945194) (← links)
- Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs (Q2945195) (← links)
- Edge Elimination in TSP Instances (Q2945197) (← links)
- The Parameterized Complexity of the Rainbow Subgraph Problem (Q2945198) (← links)
- Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees (Q2945199) (← links)
- Graph-TSP from Steiner Cycles (Q2945200) (← links)
