crutch
发表于 2025-3-26 22:20:40
Computing the independence number of dense triangle-free graphs,s remains valid if the minimum degree is required to be large. While in general graphs this problem remains .-hard even within the class of graphs with minimum degree δ > (1 − ε)., the situation is different for triangle-free graphs. It will be shown that for triangle-free graphs with δ > ./3 the in
铁砧
发表于 2025-3-27 04:10:20
http://reply.papertrans.cn/39/3881/388041/388041_32.png
青石板
发表于 2025-3-27 05:43:51
http://reply.papertrans.cn/39/3881/388041/388041_33.png
gerontocracy
发表于 2025-3-27 12:25:16
http://reply.papertrans.cn/39/3881/388041/388041_34.png
天然热喷泉
发表于 2025-3-27 15:56:54
http://reply.papertrans.cn/39/3881/388041/388041_35.png
勾引
发表于 2025-3-27 19:59:55
On greedy matching ordering and greedy matchable graphs, for which a vertex ordering exists such that the greedy algorithm always yields maximum cardinality matchings for each induced subgraph. We show that these graphs, called greedy matchable graphs, are a subclass of weakly triangulated graphs and contain strongly chordal graphs and chordal bipartite
使纠缠
发表于 2025-3-27 23:36:49
http://reply.papertrans.cn/39/3881/388041/388041_37.png
Invigorate
发表于 2025-3-28 05:24:34
http://reply.papertrans.cn/39/3881/388041/388041_38.png
AVID
发表于 2025-3-28 07:29:44
Graph-Theoretic Concepts in Computer Science978-3-540-69643-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
Aggregate
发表于 2025-3-28 13:10:18
https://doi.org/10.1007/978-981-15-9456-4Let . be the value of the maximum cut of a graph .. Let . be the expectation of . for random graphs with . vertices and . edges and let . be the expectation of . for random 2.-regular graphs with . vertices. We prove, for sufficiently large .: