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 条

[41] Solving the weighted efficient edge domination problem on bipartite permutation graphs
Lu, CL
Tang, CY
DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 203 - 211
[42] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE FOR BIPARTITE GRAPHS
LAI, TH
WEI, SS
INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 21 - 26
[43] Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
Acuna, V.
Ferreira, C. E.
Freire, A. S.
Moreno, E.
DISCRETE APPLIED MATHEMATICS, 2014, 164 : 2 - 12
[44] On a routing and scheduling problem concerning multiple edge traversals in graphs
Groves, GW
le Roux, J
van Vuuren, JH
NETWORKS, 2005, 46 (02) : 69 - 81
[45] Multirate rearrangeable Clos networks and a generalized edge coloring problem on bipartite graphs
Ngo, HQ
Vu, VH
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 834 - 840
[46] Computing the number of h-edge spanning forests in complete bipartite graphs
Stones, R.J. (rebecca.stones82@gmail.com), 1600, Discrete Mathematics and Theoretical Computer Science (16):
[47] Computing the number of h-edge spanning forests in complete bipartite graphs
Stones, Rebecca J.
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (01): : 313 - 326
[48] Multirate rearrangeable Clos networks and a generalized edge-coloring problem on bipartite graphs
Ngo, HQ
Vu, VH
SIAM JOURNAL ON COMPUTING, 2003, 32 (04) : 1040 - 1049
[49] Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs
Buyukcolak, Yasemin
DISCRETE OPTIMIZATION, 2025, 55
[50] On the approximability of the L(h, k)-labelling problem on bipartite graphs (Extended abstract)
Calamoneri, T
Vocca, P
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2005, 3499 : 65 - 77

← 1 2 3 4 5 →