Algorithms for finding distance-edge-colorings of graphs (Q2457301): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Coloring Powers of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic theory of graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar 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: A partial k-arboretum of graphs with 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: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short path queries in planar graphs in constant time / 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: A polynomial time algorithm for strong edge coloring of partial \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Coloring Partialk-Trees / rank
 
Normal rank

Latest revision as of 12:10, 27 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for finding distance-edge-colorings of graphs
scientific article

    Statements

    Algorithms for finding distance-edge-colorings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    distance-edge-coloring
    0 references
    partial \(k\)-trees
    0 references
    planar graphs
    0 references
    0 references