scholarly journals Hamiltonian paths in spanning subgraphs of line graphs

2017 ◽  
Vol 340 (6) ◽  
pp. 1359-1366
Author(s):  
Weihua He ◽  
Weihua Yang
Keyword(s):  
Line Graphs ◽  
Hamiltonian Paths ◽  
Spanning Subgraphs

scholarly journals Hamiltonian cycles in spanning subgraphs of line graphs

2016 ◽  
Vol 209 ◽  
pp. 287-295 ◽  
Author(s):  
Hao Li ◽  
Weihua He ◽  
Weihua Yang ◽  
Yandong Bai
Keyword(s):  
Hamiltonian Cycles ◽  
Line Graphs ◽  
Spanning Subgraphs

scholarly journals A note on contracting claw-free graphs

2013 ◽  
Vol Vol. 15 no. 2 (Discrete Algorithms) ◽  
Author(s):  
Jiří Fiala ◽  
Marcin Kamiński ◽  
Daniël Paulusma
Keyword(s):  
Line Graphs ◽  
Natural Question ◽  
Fixed Target ◽  
Induced Subgraphs ◽  
Graph Operations ◽  
Spanning Subgraphs ◽  
Discrete Algorithms ◽  
International Audience ◽  
Np Complete ◽  
Host Graph

Discrete Algorithms International audience A graph containment problem is to decide whether one graph called the host graph can be modified into some other graph called the target graph by using a number of specified graph operations. We consider edge deletions, edge contractions, vertex deletions and vertex dissolutions as possible graph operations permitted. By allowing any combination of these four operations we capture the following problems: testing on (induced) minors, (induced) topological minors, (induced) subgraphs, (induced) spanning subgraphs, dissolutions and contractions. We show that these problems stay NP-complete even when the host and target belong to the class of line graphs, which form a subclass of the class of claw-free graphs, i.e., graphs with no induced 4-vertex star. A natural question is to study the computational complexity of these problems if the target graph is assumed to be fixed. We show that these problems may become computationally easier when the host graphs are restricted to be claw-free. In particular we consider the problems that are to test whether a given host graph contains a fixed target graph as a contraction.

Enumerating Highly-Edge-Connected Spanning Subgraphs

2019 ◽  
Vol E102.A (9) ◽  
pp. 1002-1006
Author(s):  
Katsuhisa YAMANAKA ◽  
Yasuko MATSUI ◽  
Shin-ichi NAKANO
Keyword(s):  
Spanning Subgraphs

scholarly journals The properties of anti-fuzzy line graphs regular

2021 ◽  
Vol 1872 (1) ◽  
pp. 012010
Author(s):  
Y Trisanti ◽  
T Nusantara
Keyword(s):  
Line Graphs

On maximal energy of line graphs with given parameters

2021 ◽  
Vol 619 ◽  
pp. 12-49
Author(s):  
Yiting Cai ◽  
Bo Zhou ◽  
Mengmeng Gao
Keyword(s):  
Line Graphs ◽  
Maximal Energy
Sign in / Sign up

Export Citation Format

Share Document