scientific article; zbMATH DE number 6964031

zbMath1462.05301MaRDI QIDQ4691867

V. V. Lepin

Publication date: 24 October 2018

Full work available at URL: http://mathnet.ru/eng/timb210

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cographsunicyclic graphsindependent \(\mathcal{H}\)-packingthin spider graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterized complexity of induced graph matching on claw-free graphs
• On computing the minimum 3-path vertex cover and dissociation number of graphs
• Irredundancy in circular arc graphs
• Induced matchings in bipartite graphs
• Some results on graphs without long induced paths
• Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
• Brambles and independent packings in chordal graphs
• Packings by cliques and by finite families of graphs
• On the X-join decomposition for undirected graphs
• Packing subgraphs in a graph
• NP-completeness of some generalizations of the maximum matching problem
• Induced matchings
• Modular decomposition and transitive orientation
• Efficient subgraphs packing
• Stability number of bull- and chair-free graphs revisited
• Induced matchings in asteroidal triple-free graphs
• Induced matchings in intersection graphs.
• Maximum induced matchings of random cubic graphs
• Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
• A simple linear time algorithm for cograph recognition
• Finding a maximum induced matching in weakly chordal graphs
• On maximum induced matchings in bipartite graphs
• Packing triangles in bounded degree graphs.
• New results on induced matchings
• The complexity of dissociation set problems in graphs
• NP-hard graph problems and boundary classes of graphs
• Independent packings in structured graphs
• Parameterized Complexity of Induced H-Matching on Claw-Free Graphs
• On the Complexity of General Graph Factor Problems
• A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• A Linear Recognition Algorithm for Cographs
• Node-Deletion Problems on Bipartite Graphs
• Bipartite Domination and Simultaneous Matroid Covers
• Induced matchings in cubic graphs
• Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs
• Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
• The k‐piece packing problem
• Transitiv orientierbare Graphen
• The \(K_r\)-packing problem

This page was built for publication: