Colour degree matrices of graphs with at most one cycle

DOI10.1016/j.dam.2015.07.025zbMath1339.05135OpenAlexW1170286866MaRDI QIDQ298973

F. Blanchet-Sadri, M. Dambrine

Publication date: 21 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.025

zbMATH Keywords

discrete tomographycolour degree matrixdegree constrained edge-partitioningedge packingedge-disjoint realisations

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Half-regular factorizations of the complete bipartite graph ⋮ Packing tree degree sequences ⋮ Constructing bounded degree graphs with prescribed degree and neighbor degree sequences ⋮ Edge disjoint caterpillar realizations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• A theorem on flows in networks
• On the computational complexity of reconstructing lattice sets from their \(X\)-rays
• A solvable case of image reconstruction in discrete tomography
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Packing of graphic n-tuples
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
• A remark on the existence of finite graphs
• Combinatorial Properties of Matrices of Zeros and Ones
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Seven criteria for integer sequences being graphic
• Unicyclic realizability of a degree list
• On the use of graphs in discrete tomography

This page was built for publication: Colour degree matrices of graphs with at most one cycle