Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-03409-1_29
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

NC Algorithms for Computing the Number of Perfect Matchings in K 3,3-Free Graphs and Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1988English

Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs

2019English

A Weighted K T,t -Free T-Factor Algorithm for Bipartite Graphs

English

Closed K-Stop Distance in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Triangle-Free Planar Graphs as Segments Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Effective Matchmaking and $K$-Chromatic Graphs

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1973English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy