Partitioning the edges of a graph (Q1259608): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Anthony J. W. Hilton / rank
Normal rank
 
Property / author
 
Property / author: Anthony J. W. Hilton / 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/0095-8956(78)90004-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067468322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring the Edges of a Multigraph so that Each Vertex has at Most <i>j</i> , or at Least <i>j</i> , Edges of Each Colour on it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further remarks on partitioning the edges of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115603 / rank
 
Normal rank

Latest revision as of 02:38, 13 June 2024

scientific article
Language Label Description Also known as
English
Partitioning the edges of a graph
scientific article

    Statements