Edge-Coloring Partialk-Trees
From MaRDI portal
Recommendations
- Edge-b-coloring trees
- Edge coloring a k-tree into two smaller trees
- A note on edge colorings and trees
- A parallel algorithm for edge-coloring partial k-trees
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- scientific article; zbMATH DE number 3857145
- Nonrepetitive edge-colorings of trees
- Edge-colorings of complete graphs that avoid polychromatic trees
- Interval edge-colorings of trees with restrictions on the edges
- Feasible edge colorings of trees with cardinality constraints
Cited in
(34)- Mixed graph edge coloring
- A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees
- Linear-time algorithms for partial k-tree complements
- Counting \(H-\)colorings of partial \(k-\)trees
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- A linear time algorithm for edge coloring of binomial trees
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Algorithms for finding distance-edge-colorings of graphs
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
- List edge-coloring and total coloring in graphs of low treewidth
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- scientific article; zbMATH DE number 3857145 (Why is no real title available?)
- The parameterised complexity of list problems on graphs of bounded treewidth
- scientific article; zbMATH DE number 1262791 (Why is no real title available?)
- Edge coloring a k-tree into two smaller trees
- scientific article; zbMATH DE number 1522942 (Why is no real title available?)
- scientific article; zbMATH DE number 1796974 (Why is no real title available?)
- A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
- A parallel algorithm for edge-coloring partial k-trees
- A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
- Computing and Combinatorics
- Chromatic index, treewidth and maximum degree
- Chromatic index, treewidth and maximum degree
- Clique-perfectness of complements of line graphs
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Linear arboricity of degenerate graphs
- Finding edge-disjoint paths in partial k-trees
- Algorithms for finding f-colorings of partial k-trees
- Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
- Fast algorithms for Vizing's theorem on bounded degree graphs
- Edge-coloring sparse graphs with Colors in quasilinear time
- Chromatic index under parameterized settings
- Oriented colorings of partial 2-trees
This page was built for publication: Edge-Coloring Partialk-Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837389)
