Pages that link to "Item:Q1197012"
From MaRDI portal
The following pages link to A solution to a colouring problem of P. Erdős (Q1197012):
Displaying 29 items.
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Chords in longest cycles (Q684125) (← links)
- What is on his mind? (Q709300) (← links)
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs (Q709325) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Choosability of the square of planar subcubic graphs with large girth (Q1025548) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- The graph polynomial and the number of proper vertex colorings (Q1296159) (← links)
- Independent dominating sets and a second hamiltonian cycle in regular graphs (Q1386422) (← links)
- Chords of longest cycles in cubic graphs (Q1386433) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- On the AVDTC of 4-regular graphs (Q2017055) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Cooperative colorings and independent systems of representatives (Q2346466) (← links)
- An algorithm for identifying cycle-plus-triangles graphs (Q2357769) (← links)
- Extended skew partition problem (Q2433705) (← links)
- Independent systems of representatives in weighted graphs (Q2460628) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
- On 3-stage Clos networks with different nonblocking requirements on two types of calls (Q2569163) (← links)
- The intersection of a matroid and a simplicial complex (Q3420348) (← links)
- Total choosability of multicircuits II (Q4537555) (← links)
- Fair Representation by Independent Sets (Q4604368) (← links)
- General Parity Result and Cycle‐Plus‐Triangles Graphs (Q4978447) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- On finding constrained independent sets in cycles (Q6130317) (← links)
- Partitioning into common independent sets via relaxing strongly base orderability (Q6144384) (← links)
