A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundancy in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of strong edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Coloring Partialk-Trees / rank
 
Normal rank

Latest revision as of 16:21, 7 June 2024

scientific article
Language Label Description Also known as
English
A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
scientific article

    Statements

    A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (English)
    0 references
    23 November 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Edge coloring
    0 references
    Strong matching
    0 references
    Strong edge coloring
    0 references
    Bounded tree-width
    0 references
    0 references