On caterpillar factors in graphs

DOI10.1016/j.tcs.2020.09.022zbMath1464.68276OpenAlexW3086688232MaRDI QIDQ2210502

Zsolt Tuza, Csilla Bujtás, Stanlislav Jendroľ

Publication date: 6 November 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.09.022

zbMATH Keywords

caterpillar factorinternally even caterpillar factorodd caterpillar factor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On strongly planar 3SAT
• Factors and factorizations of graphs. Proof techniques in factor theory
• Graph factors and factorization: 1985--2003: a survey
• General factors of graphs
• Matching theory
• F-factors of graphs: A generalized matching problem
• On generalized matching problems
• Treewidth. Computations and approximations
• Regular graphs, regular factors, and the impact of Petersen's theorems
• On specific factors in graphs
• Factors and factorizations of graphs—a survey
• Packings by Complete Bipartite Graphs
• Planar Formulae and Their Uses
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• Paths, Trees, and Flowers

This page was built for publication: On caterpillar factors in graphs