Pages that link to "Item:Q293269"
From MaRDI portal
The following pages link to Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269):
Displaying 21 items.
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Clique-perfectness of claw-free planar graphs (Q503649) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- On balanced graphs (Q2583124) (← links)
- Balancedness of some subclasses of circular-arc graphs (Q2861542) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Algorithms for maximumk-colorings andk-coverings of transitive graphs (Q3783310) (← links)
- Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (Q4978445) (← links)
- Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5891090) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
