The following pages link to On the divisibility of graphs (Q5957752):
Displaying 34 items.
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- On the divisibility graph for finite sets of positive integers (Q501792) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Complexity of clique coloring and related problems (Q551168) (← links)
- Tight bounds on the clique chromatic number (Q820840) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory (Q858295) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
- Some problems on induced subgraphs (Q1693168) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- A transformation which preserves the clique number (Q1850572) (← links)
- Study of the divisor graph. II (Q1865180) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- 2-divisibility of some odd hole free graphs (Q2155661) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Study of the divisor graph. III (Q2569660) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Subgraph-avoiding coloring of graphs (Q3553235) (← links)
- (Q4329065) (← links)
- (Q4711902) (← links)
- (Q5033139) (← links)
- Brief survey on divisor graphs and divisor function graphs (Q6085211) (← links)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
- Graphs with girth 9 and without longer odd holes are 3-colourable (Q6565814) (← links)
- On the chromatic number of a family of odd hole free graphs (Q6670771) (← links)
