The following pages link to (Q3856672):
Displaying 50 items.
- Unique Fulkerson coloring of Petersen minor-free cubic graphs (Q458594) (← links)
- Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach (Q493717) (← links)
- Graph invariants and large cycles: a survey (Q539347) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- On biclique partitions of the complete graph (Q686164) (← links)
- Transforming eulerian trails (Q686289) (← links)
- A note on Halton's conjecture (Q707336) (← links)
- The nil-graph of ideals of a commutative ring (Q726494) (← links)
- Lower bounds for the clique and the chromatic numbers of a graph (Q790829) (← links)
- On the nullity and the matching number of unicyclic graphs (Q837008) (← links)
- The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
- On the crossing numbers of Cartesian products with paths (Q875940) (← links)
- Singular distance powers of circuits (Q932994) (← links)
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\) (Q944744) (← links)
- On the crossing number of \(K_{ m } \square P_{n}\) (Q995761) (← links)
- The crossing number of \(K_{2,m}\square P_n\) (Q998409) (← links)
- Inclusion relations of certain graph eigenspaces (Q1024978) (← links)
- Hamilton paths and cycles in vertex-transitive graphs of order \(6p\) (Q1044913) (← links)
- Nonorientable genus of nearly complete bipartite graphs (Q1092915) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Grids and their minors (Q1097897) (← links)
- A directed graph version of strongly regular graphs (Q1101124) (← links)
- Score sequences: Lexicographic enumeration and tournament construction (Q1115880) (← links)
- Finite planes and graphs (Q1121905) (← links)
- An algorithm for imbedding cubic graphs in the torus (Q1140090) (← links)
- Strongly regular graphs and finite Ramsey theory (Q1170268) (← links)
- Hamiltonian paths in vertex-symmetric graphs of order 5p (Q1172069) (← links)
- On tournament matrices (Q1183197) (← links)
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type (Q1197037) (← links)
- Idempotence for sign-pattern matrices (Q1210394) (← links)
- On the genus of the tensor product of graphs where one factor is a regular graph (Q1339860) (← links)
- A numbering of the vertices of special networks (Q1356750) (← links)
- On the line graphs of the complete \(r\)-partite graphs (Q1363708) (← links)
- The thickness of a minor-excluded class of graphs (Q1379835) (← links)
- Cheeger constants of Platonic graphs. (Q1426114) (← links)
- Upper bounds of the spectral radius of graphs in terms of genus (Q1569038) (← links)
- A planarity criterion for cubic bipartite graphs (Q1584420) (← links)
- Largest eigenvalue of a unicyclic mixed graphs (Q1764382) (← links)
- A modular approach to Sprouts (Q1765239) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- Strongly edge triangle regular graphs and a conjecture of Kotzig (Q1815320) (← links)
- Polynomial reconstruction and terminal vertices (Q1855397) (← links)
- Paired-domination number of claw-free odd-regular graphs (Q2012885) (← links)
- On bipartite graphs having minimum fourth adjacency coefficient (Q2117523) (← links)
- The outerplanar crossing number of the complete bipartite graph (Q2172421) (← links)
- Line graph links (Q2240655) (← links)
- Underlying simple graphs (Q2305340) (← links)
- About supergraphs. I (Q2311519) (← links)
- About supergraphs. II (Q2311520) (← links)
- About supergraphs. III (Q2337335) (← links)
