Pages that link to "Item:Q4693382"

The following pages link to A characterisation of well-covered cubic graphs (Q4693382):

Displaying 31 items.

• Well-covered triangulations. IV (Q323041) (← links)
• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• On well-covered pentagonalizations of the plane (Q526819) (← links)
• Well-covered circulant graphs (Q626761) (← links)
• The well-covered dimension of random graphs (Q864120) (← links)
• The minimal spectral radius of graphs with a given diameter (Q880046) (← links)
• Strongly well-covered graphs (Q1336664) (← links)
• The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
• Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
• On vertex decomposable and Cohen-Macaulay regular graphs (Q1755493) (← links)
• On well-covered Cartesian products (Q1756093) (← links)
• On well-covered direct products (Q2118250) (← links)
• Well-hued graphs (Q2166254) (← links)
• On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
• On the structure of 4-regular planar well-covered graphs (Q2192121) (← links)
• Graphs in which all maximal bipartite subgraphs have the same order (Q2216453) (← links)
• Detecting strong cliques (Q2312812) (← links)
• Well-covered graphs and factors (Q2492219) (← links)
• The face pair of planar graphs (Q2502900) (← links)
• Characterization of cubic graphs \(G\) with \(\operatorname{ir}_t(G)=\operatorname{IR}_t(G)=2\) (Q2509544) (← links)
• The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
• On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
• (Q3136983) (← links)
• (Q4432949) (← links)
• (Q4464779) (← links)
• (Q4622618) (← links)
• A characterization of Zm-well-covered graphs of girth 6 or more (Q4948753) (← links)
• A classification of 1-well-covered graphs (Q5097748) (← links)
• Characterization of \(Z_m\)-well-covered graphs for some classes of graphs (Q5936038) (← links)
• Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
• 1-well-covered graphs containing a clique of size \(n/3\) (Q6669819) (← links)