Short solution of Kotzig's problem for bipartite graphs
type: Item
instance of: scholarly article
title: Short solution of Kotzig's problem for bipartite graphs
zbMATH Open document ID: 1023.05055
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1464270
zbMATH Keywords: colorings
author: Armen S. Asratian
MaRDI profile type: Publication
full work available at URL: jctb.1998.1838
OpenAlex ID: W2003656643
cites work: Q4006531
cites work: Q3362661
cites work: Q5422499
cites work: Q5604409
cites work: Restricted edge-colourings of bipartite graphs
cites work: Q3480087
cites work: The NP-Completeness of Edge-Coloring
cites work: 25 pretty graph colouring problems
cites work: Transformations of edge-colourings of cubic graphs
cites work: NP completeness of finding the chromatic index of regular graphs
cites work: A Theorem on Coloring the Lines of a Network
cites work: Q4517442
cites work: Q5611549
cites work: Some graph‐theoretical models for scheduling in automated production systems
DOI: 10.1006/JCTB.1998.1838
description: scientific article; zbMATH DE number 1464270