König Graphs with Respect to the 4-Path and Its Spanning Supergraphs
| Autor: | Dmitriy S. Malyshev, D. B. Mokeev |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Class (set theory)
Mathematics::Combinatorics Property (philosophy) business.industry Applied Mathematics 02 engineering and technology Disjoint sets 01 natural sciences Industrial and Manufacturing Engineering 010101 applied mathematics Set (abstract data type) Combinatorics 020303 mechanical engineering & transports Cardinality 0203 mechanical engineering Computer Science::Discrete Mathematics TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Path (graph theory) Bipartite graph 0101 mathematics Computer Science::Data Structures and Algorithms business MathematicsofComputing_DISCRETEMATHEMATICS Mathematics Subdivision |
| Zdroj: | Journal of Applied and Industrial Mathematics. 13:85-92 |
| ISSN: | 1990-4797 1990-4789 |
| DOI: | 10.1134/s1990478919010101 |
| Popis: | We describe the class of graphs whose every subgraph has the next property: The maximal number of disjoint 4-paths is equal to the minimal cardinality of sets of vertices such that every 4-path in the subgraph contains at least one of these vertices.We completely describe the set of minimal forbidden subgraphs for this class. Moreover, we present an alternative description of the class based on the operations of edge subdivision applied to bipartite multigraphs and the addition of the so-called pendant subgraphs, isomorphic to triangles and stars. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink