AbstractWe consider those edge-minimal graphs having no homomorphism into the five-cycle. We characterize constructively such graphs having the additional property that they contain no topological K4 as a subgraph
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractWe prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism ...
AbstractWe consider those edge-minimal graphs having no homomorphism into the five-cycle. We charact...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
Let $H$ be a graph. A graph $G$ is $H$-critical if every proper subgraph of $G$ admits a homomorphis...
We determine the structure of {C₃,C₅}-free graphs graphs with n vertices and minimum degree larger t...
A full-homomorphism between a pair of graphs is a vertex mapping that preserves adjacencies and non-...
Given two graphs H1 and H2, a graph G is (H1, H2)-free if it contains no induced subgraph isomorphic...
AbstractWe prove that for every graph H and positive integers k and l there exists a graph G with gi...
A combinatorial notion of null-homotopy for graphs was introduced by Duchet, Las Vergnas, and Meynie...
AbstractIn this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges co...
A graph is H-free if it has no induced subgraph isomorphic to H. We characterize all graphs H for wh...
A graph is H-free if it has no induced subgraph isomorphic to H. We characterize all graphs H for wh...
For graphs G and H, an H-coloring of G is an edge-preserving mapping from V(G) to V(H). In the H-Col...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractWe prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism ...
AbstractWe consider those edge-minimal graphs having no homomorphism into the five-cycle. We charact...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
Let $H$ be a graph. A graph $G$ is $H$-critical if every proper subgraph of $G$ admits a homomorphis...
We determine the structure of {C₃,C₅}-free graphs graphs with n vertices and minimum degree larger t...
A full-homomorphism between a pair of graphs is a vertex mapping that preserves adjacencies and non-...
Given two graphs H1 and H2, a graph G is (H1, H2)-free if it contains no induced subgraph isomorphic...
AbstractWe prove that for every graph H and positive integers k and l there exists a graph G with gi...
A combinatorial notion of null-homotopy for graphs was introduced by Duchet, Las Vergnas, and Meynie...
AbstractIn this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges co...
A graph is H-free if it has no induced subgraph isomorphic to H. We characterize all graphs H for wh...
A graph is H-free if it has no induced subgraph isomorphic to H. We characterize all graphs H for wh...
For graphs G and H, an H-coloring of G is an edge-preserving mapping from V(G) to V(H). In the H-Col...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractWe prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism ...
DOI
Add to ORKG