ON NUMBER OF DISJOINT EDGES IN A GRAPH

被引：7

|

作者：

WEINSTEIN, JM

机构：

来源：

CANADIAN JOURNAL OF MATHEMATICS | 1963年 / 15卷 / 01期

关键词：

D O I：

10.4153/CJM-1963-012-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：106 / &

相关论文

共 50 条

[21] Bounds for the number of meeting edges in graph partitioning
Qinghou Zeng
Jianfeng Hou
Czechoslovak Mathematical Journal, 2017, 67 : 741 - 752
[22] MAXIMUM NUMBER OF EDGES IN A GRAPH WITHOUT TRIANGLES
SCHWENK, AJ
AMERICAN MATHEMATICAL MONTHLY, 1979, 86 (02): : 135 - 136
[23] The number of edges in power graph of finite groups
Jafari, S. H.
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2021, 14 (03)
[24] THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES
Kotani, Keiko
Nakamura, Shunsuke
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2015, 15 (02): : 153 - 166
[25] Edges not contained in triangles and the number of contractible edges in a 4-connected graph
Ando, Kiyoshi
Egawa, Yoshimi
DISCRETE MATHEMATICS, 2008, 308 (23) : 5463 - 5472
[26] MAXIMUM NUMBER OF DISJOINT PATHS CONNECTING SPECIFIED TERMINALS IN A GRAPH
YINNONE, H
DISCRETE APPLIED MATHEMATICS, 1994, 55 (02) : 183 - 195
[27] Minimum number of disjoint linear forests covering a planar graph
Wang, Huijuan
Wu, Lidong
Wu, Weili
Wu, Jianliang
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (01) : 274 - 287
[28] On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
Frankl, Peter
Roedl, Vojtech
Rucinski, Andrzej
COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (1-2): : 141 - 148
[29] Minimum number of disjoint linear forests covering a planar graph
Huijuan Wang
Lidong Wu
Weili Wu
Jianliang Wu
Journal of Combinatorial Optimization, 2014, 28 : 274 - 287
[30] ESTIMATING THE NUMBER OF DISJOINT EDGES IN SIMPLE TOPOLOGICAL GRAPHS VIA CYLINDRICAL DRAWINGS
Fulek, Radoslav
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 116 - 121

← 1 2 3 4 5 →