Pages that link to "Item:Q1425115"
From MaRDI portal
The following pages link to Homomorphisms from sparse graphs with large girth. (Q1425115):
Displaying 29 items.
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Homomorphisms from sparse graphs to the Petersen graph (Q709319) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Density of 5/2-critical graphs (Q1705839) (← links)
- Counterexamples to Jaeger's circular flow conjecture (Q1748263) (← links)
- Circular coloring of planar digraphs (Q1928289) (← links)
- The chromatic number of signed graphs with bounded maximum average degree (Q2143044) (← links)
- On the density of \(C_7\)-critical graphs (Q2151187) (← links)
- Circular vertex arboricity (Q2275930) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- On the odd girth and the circular chromatic number of generalized Petersen graphs (Q2359794) (← links)
- Properties of an Approximability-related Parameter on Circular Complete Graphs (Q2840526) (← links)
- Circular consecutive choosability of k-choosable graphs (Q3018072) (← links)
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems (Q3466342) (← links)
- Circular choosability (Q3652533) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Circular Flows in Planar Graphs (Q5216780) (← links)
- Homomorphisms of Signed Graphs (Q5265329) (← links)
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs (Q5272645) (← links)
- A note on<i>n</i>-tuple colourings and circular colourings of planar graphs with large odd girth (Q5431618) (← links)
- Circular coloring and fractional coloring in planar graphs (Q6056812) (← links)
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ (Q6081578) (← links)
- Fractional coloring planar graphs under Steinberg-type conditions (Q6113758) (← links)
- Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) (Q6157430) (← links)
- Homomorphisms to small negative even cycles (Q6201924) (← links)
