Pages that link to "Item:Q4806592"
From MaRDI portal
The following pages link to On the complexity of bicoloring clique hypergraphs of graphs (Q4806592):
Displaying 38 items.
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Complexity of clique coloring and related problems (Q551168) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Limit theory of combinatorial optimization for random geometric graphs (Q2075326) (← links)
- On the complexity of local-equitable coloring of graphs (Q2077396) (← links)
- A generalization of Grötzsch Theorem on the local-equitable coloring (Q2110276) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← 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)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- Clique-Coloring Circular-Arc Graphs (Q2840551) (← links)
- On star and biclique edge-colorings (Q2968507) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
- Clique-coloring UE and UEH graphs (Q3503551) (← links)
- Subgraph-avoiding coloring of graphs (Q3553235) (← links)
- Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
- (Q5089217) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)
- Tight asymptotics of clique‐chromatic numbers of dense random graphs (Q6074590) (← links)
- The jump of the clique chromatic number of random graphs (Q6076219) (← links)
- On the complexity of local-equitable coloring in claw-free graphs with small degree (Q6616437) (← links)
