Dense arbitrarily vertex decomposable graphs

DOI10.1007/S00373-011-1077-3MaRDI QIDQ1928285zbMATH OpenOpenAlexFDO

Authors Mirko Horňák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Woźniak

Publication date 3 January 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-011-1077-3

zbMATH Keywords

arbitrarily vertex decomposable graphindependence numberperfect matchingtraceable graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Density (toughness, etc.) (05C42) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 5238175
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Recursively arbitrarily vertex-decomposable graphs
• On some families of arbitrarily vertex decomposable spiders
• On arbitraly vertex decomposable unicyclic graphs with dominating cycle

Cites work

• A degree bound on decomposable trees
• A homology theory for spanning tress of a graph
• A lower bound for the circumference of a graph
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Arbitrarily vertex decomposable suns with few rays
• Decomposable trees: A polynomial algorithm for tripodes
• scientific article; zbMATH DE number 3515497 (Why is no real title available?)
• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• Note on Hamilton Circuits
• On arbitrarily vertex decomposable trees
• On-line arbitrarily vertex decomposable suns
• On-line arbitrarily vertex decomposable trees

Cited in

(18)

• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• More aspects of arbitrarily partitionable graphs
• Arbitrary partitionability of product graphs
• Partitioning the Cartesian product of a tree and a cycle
• On some families of arbitrarily vertex decomposable spiders
• Partitioning powers of traceable or Hamiltonian graphs
• Decomposing large graphs with small graphs of high density
• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• An Ore-type condition for arbitrarily vertex decomposable graphs
• On three polynomial kernels of sequences for arbitrarily partitionable graphs
• Some properties of minimal arbitrarily partitionable graphs
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Closure results for arbitrarily partitionable graphs
• Arbitrarily edge-partitionable graphs
• Toughness properties of arbitrarily partitionable graphs
• Partitioning vertices and edges of graphs into connected subgraphs
• A _3 condition for arbitrarily partitionable graphs
• Dense arbitrarily partitionable graphs

This page was built for publication: Dense arbitrarily vertex decomposable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928285)