Pages that link to "Item:Q427833"

The following pages link to Independent sets and matchings in subcubic graphs (Q427833):

Displaying 20 items.

• Matchings in graphs of odd regularity and girth (Q394288) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← 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)
• The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429) (← links)
• Bounded clique cover of some sparse graphs (Q2359963) (← links)
• Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
• On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
• Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
• Independence and matching number in graphs with maximum degree 4 (Q2439118) (← links)
• The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489) (← links)
• On Lower Bounds for the Matching Number of Subcubic Graphs (Q5272918) (← links)
• A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) (← links)
• An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)