Colour degree matrices of graphs with at most one cycle

DOI10.1016/J.DAM.2015.07.025zbMATH Open1339.05135OpenAlexW1170286866MaRDI QIDQ298973FDOQ298973

A. Hillebrand, Colin McDiarmid

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

Recommendations

• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• Color degree and alternating cycles in edge-colored graphs
• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• On a type of assigning a colour from given sets to the edges of a graph

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• A theorem on flows in networks
• 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.
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A remark on the existence of finite graphs
• Combinatorial Properties of Matrices of Zeros and Ones
• Seven criteria for integer sequences being graphic
• On the computational complexity of reconstructing lattice sets from their \(X\)-rays
• A solvable case of image reconstruction in discrete tomography
• Packing of graphic \(n\)-tuples
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• Unicyclic realizability of a degree list
• Title not available (Why is that?)
• On the use of graphs in discrete tomography
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298973)