Pages that link to "Item:Q3055909"

The following pages link to Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909):

Displayed 31 items.

• Matchings, path covers and domination (Q329554) ‎ (← links)
• Average connectivity and average edge-connectivity in graphs (Q390306) ‎ (← links)
• Matchings in graphs of odd regularity and girth (Q394288) ‎ (← links)
• Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs (Q400359) ‎ (← links)
• Independent sets and matchings in subcubic graphs (Q427833) ‎ (← links)
• Matching and edge-connectivity in regular graphs (Q616391) ‎ (← links)
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs (Q905705) ‎ (← links)
• A lower bound on the acyclic matching number of subcubic graphs (Q1637156) ‎ (← links)
• Essential upper bounds on the total domination number (Q1752594) ‎ (← links)
• Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius (Q1981717) ‎ (← links)
• Largest 2-regular subgraphs in 3-regular graphs (Q2000571) ‎ (← links)
• Paired-domination number of claw-free odd-regular graphs (Q2012885) ‎ (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) ‎ (← links)
• Matching and edge-connectivity in graphs with given maximum degree (Q2032857) ‎ (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) ‎ (← links)
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) ‎ (← links)
• A generalization of Petersen's matching theorem (Q2111920) ‎ (← links)
• Spectral radius and matchings in graphs (Q2229492) ‎ (← links)
• The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429) ‎ (← links)
• Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs (Q2352793) ‎ (← links)
• On line graphs of subcubic triangle-free graphs (Q2400553) ‎ (← links)
• On matching and semitotal domination in graphs (Q2440939) ‎ (← links)
• Hamiltonicity in connected regular graphs (Q2445323) ‎ (← links)
• On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs (Q2452398) ‎ (← links)
• On extension of regular graphs (Q5031864) ‎ (← links)
• On Lower Bounds for the Matching Number of Subcubic Graphs (Q5272918) ‎ (← links)
• The numbers of cut-vertices and end-blocks in 4-regular graphs (Q5405282) ‎ (← links)
• A complete description of convex sets associated with matchings and edge‐connectivity in graphs (Q6046646) ‎ (← links)
• A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) ‎ (← links)
• On the path partition number of 6‐regular graphs (Q6057632) ‎ (← links)
• Matchings in graphs from the spectral radius (Q6116931) ‎ (← links)