The following pages link to Journal of Graph Theory (Q2725046):
Displaying 50 items.
- Grünbaum colorings of toroidal triangulations (Q5189240) (← links)
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments (Q5189241) (← links)
- Finite fields and the 1‐chromatic number of orientable surfaces (Q5190327) (← links)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree (Q5190328) (← links)
- On local connectivity of graphs with given clique number (Q5190329) (← links)
- Path homomorphisms, graph colorings, and boolean matrices (Q5190330) (← links)
- Balanced judicious bipartitions of graphs (Q5190331) (← links)
- <i>d</i>‐Regular graphs of acyclic chromatic index at least <i>d</i>+2 (Q5190332) (← links)
- Constructing isospectral non‐isomorphic digraphs from hypergraphs (Q5190333) (← links)
- Extremal graphs for homomorphisms (Q5199417) (← links)
- Recognizing connectedness from vertex-deleted subgraphs (Q5199418) (← links)
- Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)
- 2- and 3-factors of graphs on surfaces (Q5199420) (← links)
- On a conjecture of Thomassen concerning subgraphs of large girth (Q5199421) (← links)
- Switching reconstruction of digraphs (Q5199422) (← links)
- On the largest tree of given maximum degree in a connected graph (Q5202199) (← links)
- Lower bounds for lower Ramsey numbers (Q5202211) (← links)
- An upper bound on the ramsey number <i>R</i>(<i>K</i><sub>3</sub>, <i>G</i>) depending only on the size of the graph <i>G</i> (Q5202213) (← links)
- Dense bipartite digraphs (Q5203051) (← links)
- Perfect path double covers in every simple graph (Q5203059) (← links)
- Matching cutsets in graphs (Q5203060) (← links)
- On unavoidable hypergraphs (Q5203064) (← links)
- List coloring with requests (Q5207462) (← links)
- Minimum codegree condition for perfect matchings in k‐partite k‐graphs (Q5207463) (← links)
- Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof (Q5207464) (← links)
- Induced subgraphs of graphs with large chromatic number. XII. Distant stars (Q5207465) (← links)
- A precolouring extension of Vizing's theorem (Q5207466) (← links)
- On the clique number of the square of a line graph and its relation to maximum degree of the line graph (Q5207468) (← links)
- Size Ramsey numbers of stars versus cliques (Q5207469) (← links)
- The edge‐subgraph poset of a graph and the edge reconstruction conjecture (Q5207470) (← links)
- Coverability of graph by three odd subgraphs (Q5207471) (← links)
- Linearly <i>χ</i>‐bounding (<i>P</i><sub>6</sub>, <i>C</i><sub>4</sub>)‐free graphs* (Q5207472) (← links)
- Upper bounds on the uniquely restricted chromatic index (Q5229533) (← links)
- Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor (Q5229534) (← links)
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (Q5229535) (← links)
- The size‐Ramsey number of powers of paths (Q5229536) (← links)
- On ‐connected graphs (Q5229537) (← links)
- Maximizing the mean subtree order (Q5229538) (← links)
- Partitioning a graph into monochromatic connected subgraphs (Q5229539) (← links)
- Extending partial representations of circle graphs (Q5229540) (← links)
- Strong subgraph <i>k</i>‐connectivity (Q5241602) (← links)
- Tetravalent half‐arc‐transitive bi‐<i>p</i>‐metacirculants (Q5241603) (← links)
- Shorter signed circuit covers of graphs (Q5241604) (← links)
- A note on immersion intertwines of infinite graphs (Q5241605) (← links)
- Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable (Q5241606) (← links)
- On the independence number of graphs related to a polarity (Q5241607) (← links)
- Eccentricities in the flip‐graphs of convex polygons (Q5241608) (← links)
- Bipartite spanning sub(di)graphs induced by 2‐partitions (Q5241609) (← links)
- Online Ramsey theory for a triangle on ‐free graphs (Q5241610) (← links)
- Maximising ‐colourings of graphs (Q5241611) (← links)
