Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
From MaRDI portal
Publication:3055909
DOI10.1002/jgt.20443zbMath1201.05049OpenAlexW4249395082MaRDI QIDQ3055909
Publication date: 10 November 2010
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20443
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (31)
On extension of regular graphs ⋮ A lower bound on the acyclic matching number of subcubic graphs ⋮ Matchings, path covers and domination ⋮ On line graphs of subcubic triangle-free graphs ⋮ Average connectivity and average edge-connectivity in graphs ⋮ Matchings in graphs of odd regularity and girth ⋮ Matching and edge-connectivity in regular graphs ⋮ A complete description of convex sets associated with matchings and edge‐connectivity in graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number ⋮ On the path partition number of 6‐regular graphs ⋮ Matchings in graphs from the spectral radius ⋮ Independent sets and matchings in subcubic graphs ⋮ Spectral conditions for edge connectivity and packing spanning trees in multigraphs ⋮ On matching and semitotal domination in graphs ⋮ Hamiltonicity in connected regular graphs ⋮ On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs ⋮ Spectral radius and matchings in graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ The numbers of cut-vertices and end-blocks in 4-regular graphs ⋮ Essential upper bounds on the total domination number ⋮ Largest 2-regular subgraphs in 3-regular graphs ⋮ Paired-domination number of claw-free odd-regular graphs ⋮ A characterization of graphs with given maximum degree and smallest possible matching number ⋮ Matching and edge-connectivity in graphs with given maximum degree ⋮ A characterization of graphs with given maximum degree and smallest possible matching number. II ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph ⋮ A generalization of Petersen's matching theorem ⋮ Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs ⋮ On Lower Bounds for the Matching Number of Subcubic Graphs
Cites Work
- Unnamed Item
- Covering all cliques of a graph
- Transversal numbers of uniform hypergraphs
- Tight bounds on maximal and maximum matchings
- Tight lower bounds on the size of a maximum matching in a regular graph
- On matching and total domination in graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Some remarks on domination
- A linear Vizing‐like relation relating the size and total domination number of a graph
- The Factorization of Linear Graphs
This page was built for publication: Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
