A Certifying Algorithm for 3-Colorability of P 5-Free Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-10631-6_61
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Coverings of Cubic Graphs and 3-Edge Colorability

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

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

English

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1999English

Even-Hole-Free Graphs Part II: Recognition Algorithm

Journal of Graph Theory
GeometryTopology
2002English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A 1-2-3-4 Result for the 1-2-3 Conjecture in 5-Regular Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

An Expected Polynomial Time Algorithm for Coloring 2-Colorable 3-Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

The Structure and the Number of P 7 -Free Bipartite Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2017English

A 3/2-Approximation Algorithm for Finding Spanning Trees With Many Leaves in Cubic Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy