Packing six \(T\)-joins in plane graphs

DOI10.1016/j.jctb.2015.09.002zbMath1327.05075DBLPjournals/jct/DvorakKK16arXiv1009.5912OpenAlexW2104251191WikidataQ57601321 ScholiaQ57601321MaRDI QIDQ896004

Zdeněk Dvořák, Daniel Král', Ken-ichi Kawarabayashi

Publication date: 11 December 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.5912

zbMATH Keywords

planar graphsedge coloring\(T\)-joins

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

A survey on flows in graphs and matroids ⋮ Walk-powers and homomorphism bounds of planar signed graphs ⋮ Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem ⋮ Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees ⋮ Graph edge coloring: a survey ⋮ Edge-colouring eight-regular planar graphs ⋮ Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs

Cites Work

• Unnamed Item
• Edge-colouring seven-regular planar graphs
• Edge-colouring eight-regular planar graphs
• Tutte's edge-colouring conjecture
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial Optimization
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte

This page was built for publication: Packing six \(T\)-joins in plane graphs