Pages that link to "Item:Q2563172"

The following pages link to Colour-critical graphs and hypergraphs (Q2563172):

Displaying 24 items.

• Sparse colour-critical hypergraphs (Q809089) (← links)
• Graph coloring satisfying restraints (Q910410) (← links)
• Subgraphs of colour-critical graphs (Q1101121) (← links)
• On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
• The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
• Critical hypergraphs for the weak chromatic number (Q1148325) (← links)
• Graph properties and hypergraph colourings (Q1184854) (← links)
• A vertex critical graph without critical edges (Q1193438) (← links)
• On the minimal number of edges in color-critical graphs (Q1272188) (← links)
• On the colorability of \(m\)-composed graphs (Q1336697) (← links)
• Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
• A Brooks type theorem for the maximum local edge connectivity (Q1753016) (← links)
• A Brooks-type result for sparse critical graphs (Q1786052) (← links)
• Restraints permitting the largest number of colourings (Q1786873) (← links)
• The complexity of generalized graph colorings (Q1923585) (← links)
• Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
• Complete colourings of hypergraphs (Q2279996) (← links)
• A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
• THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH (Q5075595) (← links)
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
• A broken cycle theorem for the restrained chromatic function (Q5742940) (← links)
• Amenable colorings (Q5906786) (← links)
• A note on \(\Delta\)-critical graphs (Q6063276) (← links)
• Coloring hypergraphs with excluded minors (Q6568846) (← links)