Colour degree matrices of graphs with at most one cycle (Q298973): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.07.025 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.07.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1170286866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-constrained edge partitioning in graphs arising from discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unicyclic realizability of a degree list / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphic n-tuples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of image reconstruction in discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of graphs in discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of reconstructing lattice sets from their \(X\)-rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the existence of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seven criteria for integer sequences being graphic / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.07.025 / rank
 
Normal rank

Latest revision as of 13:44, 9 December 2024

scientific article
Language Label Description Also known as
English
Colour degree matrices of graphs with at most one cycle
scientific article

    Statements

    Colour degree matrices of graphs with at most one cycle (English)
    0 references
    0 references
    0 references
    21 June 2016
    0 references
    colour degree matrix
    0 references
    degree constrained edge-partitioning
    0 references
    edge packing
    0 references
    discrete tomography
    0 references
    edge-disjoint realisations
    0 references

    Identifiers