Results 171 to 180 of about 916,150 (184)
A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs [PDF]
Discrete Mathematics, 2009 An edge of a k-connected graph is said to be k-contractible if its contraction results in a k-connected graph. A k-connected non-complete graph with no k-contractible edge, is called contraction critical k-connected.
Li, Tingting, Su, Jianji
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the rank of the distance matrix of graphs
Applied Mathematics and Computation, 2022Adrian Pastine +2 more
exaly
A Polynomial Kernel for Trivially Perfect Editing
Algorithmica, 2017Pål Grønås Drange, Michal Pilipczuk
exaly
An Edge Completion Problem on Chordal and Trivially Perfect Graphs
Mitre Costa Dourado +2 moreopenaire +1 more source
A Polynomial Kernel for Trivially Perfect Editing
Lecture Notes in Computer Science, 2015Pål Grønås Drange, Michal Pilipczuk
exaly
Enumerative aspects of certain subclasses of perfect graphs
Discrete Mathematics, 1999Venkatesan Guruswami
exaly
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
Discrete Mathematics, 2006Frank Gurski
exaly
New conjectures on perfect matchings in cubic graphs
Electronic Notes in Discrete Mathematics, 2013Giuseppe Mazzuoccolo
exaly