NoteOn a Problem of R. Häggkvist Concerning Edge-Colouring of Bipartite Graphs

被引：0

|

作者：

Ján Ninčák

Peter J. Owens

机构：

[1] Technical University of Košice,late of: Department of Mathematics

[2] University of Surrey,late of: Dept. of Mathematics and Statistics

来源：

Combinatorica | 2004年 / 24卷

关键词：

05C15; 05B15;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：325 / 329

页数：4

相关论文

共 50 条

[31] A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
Lang, Richard
GRAPHS AND COMBINATORICS, 2016, 32 (03) : 1055 - 1064
[32] A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
Richard Lang
Graphs and Combinatorics, 2016, 32 : 1055 - 1064
[33] From light edges to strong edge-colouring of 1-planar graphs
1600, Discrete Mathematics and Theoretical Computer Science (22):
[34] PARALLEL O(LOG N) TIME EDGE-COLOURING OF TREES AND HALIN GRAPHS
GIBBONS, AM
ISRAELI, A
RYTTER, W
INFORMATION PROCESSING LETTERS, 1988, 27 (01) : 43 - 51
[35] PROBLEM OF HALIN,R. CONCERNING INFINITE-GRAPHS .2.
ANDREAE, T
DISCRETE MATHEMATICS, 1980, 29 (03) : 219 - 227
[36] Generalizing bipartite edge colouring to solve real instances of the timetabling problem
Abraham, DJ
Kingston, JH
PRACTICE AND THEORY OF AUTOMATED TIMETABLING IV, 2003, 2740 : 288 - 298
[37] Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor
Dvorak, Zdenek
Lahiri, Abhiruk
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 291 - 304
[38] Enumeration algorithm for the edge coloring problem on bipartite graphs
Matsui, Y.
Matsui, T.
Lecture Notes in Computer Science, 1996, 1120
[39] NP completeness of the edge precoloring extension problem on bipartite graphs
Fiala, J
JOURNAL OF GRAPH THEORY, 2003, 43 (02) : 156 - 160
[40] Classifying k-edge colouring for H-free graphs
Galby, Esther
Lima, Paloma T.
Paulusma, Daniel
Ries, Bernard
INFORMATION PROCESSING LETTERS, 2019, 146 : 39 - 43

← 1 2 3 4 5 →